US 7269671 B2
Systems, methods and computer program products partition a whole program when it does not fit in a device's memory. Minimal, safe program partitions are downloaded from the server on demand into the embedded device just before their execution. Code and data of the program are partitioned such that no information regarding the control flow behavior of the program is leaked out. Thus, by observing the program partitions that are downloaded from the server to the device, an attacker is unable to guess which branches are taken in the program and what is the control flow of the program. This property of tamper resistance is valuable for secure embedded devices, such as smart cards, which could hold sensitive information and/or carry out critical computation such as financial transactions.
1. A method of transmitting a program to a device, comprising:
analyzing a program to identify one or more executable functions in said program;
determining whether each of the one or more executable functions is a recurring or non-recurring function, wherein a non-recurring function is executed only once during operation of the program, and wherein a recurring function is executed more than once during operation of the program;
partitioning the program into a plurality of program partitions based at least in part on the determination of whether each of the one or more executable functions is a recurring or non-recurring function; and
transmitting the plurality of program partitions to the device, wherein each of said plurality of program partitions are transmitted to the device only once to avoid revealing control flow information of said program during the transmission.
2. The method of
3. The method of
4. The method of
5. The method of
6. The method of
7. The method of
8. The method of
9. The method of
10. The method of
11. A computer program product for partitioning a program for transmission to a device, said computer program product comprising:
a computer usable medium having computer-readable code means embodied in said medium, said computer-readable code means comprising:
computer readable program code means for analyzing a program to identify one or more executable functions in said program;
computer readable program code means for determining whether each of the one or more executable functions is a recurring and or non-recurring function, wherein a non-recurring function is executed only once during operation of the program, and wherein a recurring function is executed more than once during operation of the program;
computer readable program code means for partitioning the program into a plurality of program partitions based at least in part on the determination of whether each of the one or more executable functions is a recurring or non-recurring function; and
computer readable program code means for transmitting the plurality of program partitions to the device, wherein each of said plurality of program partitions are transmitted to the device only once to avoid revealing control flow information of said program during the transmission.
12. The computer program product of
13. The computer program product of
14. The computer program product of
15. The computer program product of
16. The computer program product of
17. The computer program product of
18. The computer program product of
19. A method for optimizing the performance of a device, comprising:
analyzing a program to identify at least one recurring and at least one non-recurring function in said program; and
using the identification of said recurring and non-recurring functions to partition the program into a plurality of program partitions; and
transmitting to the device a request that the device memory be divided into ideal code and data segment components for receiving the plurality of program partitions.
The present invention claims the benefit of U.S. Provisional Patent Application Serial No. 60/385,713, filed Jun. 4, 2002, titled “Systems and Methods For Performing Leakage-Proof Program Partitioning For Embedded Devices”, the contents of which are hereby incorporated by reference as if set fully herein.
The present invention relates generally to systems, methods and computer program products for partitioning programs. More particularly, the invention relates to systems, methods and computer program products for partitioning the code and data of a program to permit program partitions to run on a memory constrained device and to ensure tamper resistance during the downloading of the program partitions to the device.
One of the important embedded devices that offer a tamper-resistant, secure environment is a smart card. The typical application execution scenario in smart cards involves the data being downloaded on it in an encrypted manner and the entire application executing inside it. This results in an important property of tamper resistance. Since no part of an application resides outside, for an attacker, smart card is like a black box inside which nobody knows what is going on. In other words, one is unable to observe application properties from outside the card offering tamper resistance.
A big concern of new generation of smart cards is memory resource limitation. Smart cards typically have only 8–64 KB memory which prevents large applications from residing on the smart card. Typically, multiple applications spread across multiple vendors require a high inter-operability and need large amount of resources. Added to the resource limitation are security related overheads which make even lesser space available to application developers. For example, complex encryption/decryption schemes, advanced security and transaction protocols and various authentication applications such as biometric codes have large data and/or code segments and it is a major struggle to put these features inside smart cards. This has led smart card application domains to be very limited and customized. In order to facilitate multi-applications and/or to fit large applications in the card, they must be broken into pieces. In other words, the smart card memory would hold only those parts of applications currently active or ready-to-execute. However, partitioning an application means that part of it will reside outside of the card. Furthermore, application partitions transmitted to the smart card could reveal the application behavior which in turn could be used by an attacker to launch a malicious attack. Thus, one must ensure that the partitions that are downloaded to the card do not reveal information.
There are many different means by which information leakage occurs as a result of program behavior. They are based on observable program properties by the attacker and include timing behavior, power behavior and control flow behavior. For example, by observing timing, one may guess that a loop is executing or by observing power consumption, or one may guess that a lot of memory operations are going on. This information can then be used to tamper with the secure system. Leakage of timing or power information is a somewhat indirect way to get information about the program properties and an attacker might have to resort to somewhat involved experiments to get the differential behavior. Leakage of control flow behavior of an application on the other hand, can be very dangerous and it is much simpler for an attacker to find out the differential behavior. Even arbitrary partitioning can introduce control flow information leakage and present a security hazard, which is the central problem encountered in program partitioning for tamper-resistant devices.
The potential danger of arbitrary partitioning is illustrated with reference to
Systems such as Die-Hellman and RSA, as are known in the art, may include, for example, private key operations consisting of computing R−yx mod n, where n is public and y can be found by an eavesdropper. The attacker's goal is to find x, the secret key. To illustrate the problem, it may be presumed that the implementation uses the simple modular exponentiation algorithm of
Assuming the algorithm is used to partition a program transmitted to a smart card, where the card side will ask for a program partition every time it needs it (i.e., it does not cache any program partitions for memory efficiency purpose), it is apparent that inside the loop body if the current examined bit of x is 1, then the IF-part is executed (block 16). If the current examined bit of x is 0, then the Else-part is executed (block 18). The algorithm loop (blocks 14, 20) result in a sequence of IF or ELSE blocks being transmitted through the network. If the attacker monitors this sequence, from its knowledge the attacker can guess whether the respective bits of x were 0's or 1's and obtain the secret key x. The attacker need not know whether it is a IF part or ELSE part; mere ability to differentiate IF part and ELSE part enables the guess of key x, due to the fact that the key, or its complement, was guessed. The attack thus utilizes the different program partition sequences to infer the program behavior.
The concept behind the type of attack illustrated in
In the illustrate example described above, it is clear that the major problem of partitioning by basic blocks is that the resulting partition exposes all the control flow information. After multiple iterations of a loop, by watching the sequence of program partitions transmitted, the attacker can know there is a loop and which partition is loop entry, which is loop end. The attacker can also know inside the loop body there is an IF-ELSE structure and which is the program partition controlling the branch. The attacker can virtually deduce all control information of the source program, which will lead to great potential security hole.
As is apparent from the above discussion and illustrative example, what is therefore needed are systems, methods and computer program products for partitioning a program while concealing control flow information such that an attacker can not guess a program's behavior by observing the program partitions transmitted through the network that are downloaded to a device. What is also needed is a method and computer program products for partitioning the code and data of a program to permit program partitions to run on a memory constrained device while ensuring tamper resistance during the downloading of the program partitions to the device.
To facilitate the execution of sizeable programs on devices having limited available memory, such as smart cards, systems, methods and computer program products of the present invention partition a whole program when it does not fit in the devices memory. Minimal, safe program partitions are downloaded from the server on demand into the embedded device just before execution. The systems, methods and computer program products partition the code and data of the program such that no information regarding the control flow behavior of the program is leaked out. In other words, by observing the program partitions that are downloaded from the server, an attacker is unable to guess which branches are taken in the program and what is the control flow of the program. This property, referred to herein as tamper resistance, is valuable for secure embedded devices such as smart cards, which could hold sensitive information and/or carry out critical computation such as financial transactions.
According to one aspect of the invention, systems, methods and computer program products of the present invention partition mobile code programs for code and data in a server side (in a system where programs are communicated from the server side to a device), resulting in independent program partitions which include both code and the data accessed by the code. The information included in each program partition is adequate for its execution. Mobile code partitions are downloaded into a device, such as an embedded device, one-by-one on demand. After the execution of one partition completes, the next partition is requested from the server; at the same time the updated data value may be sent back to the server to achieve data consistency on the server side. Furthermore, at the server side, each requested partition may be dynamically optimized at an intermediate form (IF) level before being sent to the embedded device.
It should be appreciated that although the present invention is described with respect to smart cards, it will also be appreciated that the methods and computer program products of the present invention are useful for any security and/or memory constrained devices, such as mobile or cellular phones, personal data assistants (PDAs), handheld computers, and the like, which may benefit from increased security and/or a decrease in the required application and data memory.
Having thus described the invention in general terms, reference will now be made to the accompanying drawings, which are not necessarily drawn to scale, and wherein:
The present invention now will be described more fully hereinafter with reference to the accompanying drawings, in which preferred embodiments of the invention are shown. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. Like numbers refer to like elements throughout.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means that implement the function specified in the flowchart block or blocks. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions that execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks.
Accordingly, blocks of the block diagrams and flowchart illustrations support combinations of means for performing the specified functions, combinations of steps for performing the specified functions and program instruction means for performing the specified functions. It will also be understood that each block of the block diagrams and flowchart illustrations, and combinations of blocks in the block diagrams and flowchart illustrations, can be implemented by special purpose hardware-based computer systems that perform the specified functions or steps, or combinations of special purpose hardware and computer instructions.
Referring again to
According to the present invention, the mobile code program 32 first undergoes a program code and data analysis 34. As will be described in further detail below, the program code and analysis 34 identifies the safe program partitions that can be downloaded from the server 33 on demand into the device 42 just before execution of the program partitions in the device 42. A safe program partition ensures tamper resistance because a sequence of such partitions does not reveal control flow information. According to an illustrative example, if L1, L2, . . . , Ln represent a series of program partitions transmitted from the server 33 to the device 42 using a particular program partitioning scheme and a device cache policy (also referred to herein as a client policy), the following sequence of program partitions as the one which leaks control flow information (violating tamper resistance):
Referring again to
After the program partitions are identified, the server 33 partitions the program into multiple program partitions 36. The partitioning may also be implemented by the program partitioning program. After the partitions are generated, the partitions are dynamically optimized 38 such that a minimal number of safe program partitions are combined while still ensuring that the combined partitions do not reveal information regarding the control flow behavior of the program when they are transmitted to the device 42. The merging of partitions is discussed in detail with reference to a merging algorithm, below. It should be appreciated that combining partitions minimizes the number of transmissions from the server 33 to the device 42. From the memory utilization point of view, it is preferred that the safe partition be as small as possible, or a minimal safe partition. However, because transmitting a number of small code snippets through a network at runtime may lead to very low efficiency, adjacent minimal safe partitions may be combined into a larger one and the result will still be safe in that the transmission of the partitions to the device 42 will not result in control flow information leakage.
Dynamic optimization, which may also be performed by the program partitioning program, can also query the device 42 to determine its memory requirements or cache policies such that the appropriate number and size of partitions are transmitted to the device 42. It will be appreciated that in partitioning a program to prevent control flow information from being discoverable as program partitions are transmitted from the server 33 to the device 42, it is important that the systems, methods and computer program products of the present invention select only those safe partitions that will not leak program control flow information by observation of their sequence when transmitted at a client's request. Safe partitioning according to the present invention is based not only on how a program is divided and transmitted, but also on how and when those partitions are sent via the network 39 to the device 42. Because what is transmitted to the device 42 depends on the cache policy of device 42 (e.g., whether to cache whole or part of incoming program partitions or not), it will be appreciated to those of skill in the art that safe program partitioning depends both on how to divide the program and on client policy of managing partitions.
According to one aspect of the invention, the requested mobile code partitions 40, 44 are downloaded into the device 42 one-by-one on demand. According to one aspect of the present invention, at the server side, each requested partition might be dynamically optimized at an intermediate form (IF) level before being sent to the embedded device. Because the program partitions are not transmitted in assembly code, the communication between the server 33 and device 42 can occur faster than otherwise possible if the partitions are transmitted in native code, such as binary form, which may be several times larger than the intermediate form.
Upon receiving a partition, the device 42 executes its partition manager and loader/linker 46, which determines the correct destination for the partition. The partition manager 46 therefore resolves the partitions and registers their locations in memory. After executing a program 48, the device 42 communicates any required results, or updated data values 50, back to the server 33. Because the device 42 may not update data values each time a partition is executed, the updating of data values is optional. After execution 48 the device 42 may transmit a next transmission request 52 to the server to request the next partition required to execute a function.
As noted above, tamper resistance is affected both by program partitioning methods or techniques and a client's caching policies because together these determine the partitions that are transmitted through the network. Systems, methods and computer program products of the present invention may function to download partitions to a device operating under any of three separate device cache policies: (1) ‘Keep Everything Received’; (2) ‘Keep Nothing Received’; and (3) ‘Keep Partitions To Which Control Is Guaranteed To Return’.
Under ‘Keep Everything Received’, a device will keep every program partition the server sends to it until the embedded program finishes execution. This policy is the least memory efficient one and puts highest memory burden on the client device. Even if a program partition will never be accessed again in the future, the device has to keep it in its local memory, wasting precious memory resource in embedded devices. However, because the device permanently stores program partition, this policy does not raise significant security concerns because program partitions need not be transmitted to the device more than once.
Under ‘Keep Nothing Received’, a device will discard the program partition immediately after its execution. This policy puts least memory burden on client device because the device only needs to keep a single program partition currently executing. This policy may be applied in the situations where client's memory is very limited. Because client will keep nothing, every program partition must be retransmitted when it is needed.
Under the third policy, ‘Keep Partitions To Which Control Is Guaranteed To Return’, a device will keep the safe partitions which control is guaranteed to return back. For examples of such partitions, consider a basic block containing a function call. Under this policy, after the function call, the control is guaranteed to return back to the calling basic block which is kept in memory under this policy. This policy places much less memory burden on client device than keep everything received policy because it only keeps partitions which will be definitely accessed again in the future.
Next, program partitioning algorithms according to the present invention will be considered. These partitioning algorithms partition the code and data of the program such that no information regarding the control flow behavior of the program is leaked out.
According to one aspect of the present invention, systems, methods and computer program products of the present invention implement a program partitioning algorithm applied to each function of a mobile program. Thus, according to one embodiment of the invention, the program partitioning is applied on a function by function basis. Continuing with the illustrative embodiment in which the device is a smart card, functions, which are well known in the art, may be transmitted to the smart card with data suitable for the smart card to execute the function. The smart card will then execute the function, returning a response to the server which provided the function. As described above, control information leakage comes from repeatedly sent partitions from server. Therefore, whether a function is capable of being invoked multiple times during a program run is critical to tamper-resistant partitioning algorithm.
Because retransmission of a program partition (or a function) will result in the possibility of control flow information leakage, methods and computer program products of the present invention classify functions as non-recurring and recurring functions. Only after this classification occurs can the partitioning of a program occur.
Non-recurring functions are those functions that will be called at most once during the program execution. As such, the functions need not be transmitted to the device multiple times for a program to execute. An illustrative example of a non-recurring function is the main function in C language because it occurs only once in a C program. Other examples of non-recurring functions include program initialization functions and finalization functions. On the other hand, recurring functions are those functions which may be called multiple times. These raise a clear and significant concern of control flow information leakage which the systems, methods and computer program products of the present invention seek to eliminate.
According to the present invention, a simple static program analysis reveals whether a function is recurring or non-recurring. An algorithm 60 implementing such an analysis, in C language, is illustrated in
The function of the algorithm 60 is illustrated in block diagram form in the flow chart of
It will be appreciated that the algorithm 60 illustrated in
According to one aspect of the present invention, the simple static program analysis revealing whether a function is recurring or non-recurring is implemented by the program partition algorithm. After dividing the partitioning problem into non-recurring function partitioning and recurring function partitioning, the program partitioning algorithm is ready to partition the program. The function of the program partitioning algorithm of the present invention will net be discussed with respect to the three client cache policies discussed above.
First, under the ‘Keep Everything Received’ policy, a client device will keep every partition it receives. Thus, every partition of the program will be sent through the network at most once. As such, there is no potential danger that the control leakage will occur because it only occurs from repeatedly transmitted partitions. Therefore, arbitrary partitioning can occur and the transmission will remain safe. The minimal safe partitions are each basic program block, and the server can simply send out, using the program partition algorithm, each program partition the client requests.
On the other hand, the program partitioning algorithm must prevent partitions from being retransmitted under both the ‘Keep Nothing Received’ and ‘Keep Partitions To Which Control Is Guaranteed To Return’ policies. The reason for this is that partitions may be transmitted regularly and multiple times under each of these policies due to the fact that the device memory does not retain a permanent copy of all program information it needs to execute under all conditions. Before the partitioning algorithms implemented by the present invention for each of these policies are discussed, the effect of function calls to tamper-resistant program partitioning should be briefly addressed so as to make clear the purpose and function of the partitioning algorithms of the present invention.
A sample function call within a safe partition is illustrated with respect to
Next, methods and computer program products to partition programs under the ‘Keep Nothing Received’ and ‘Keep Partitions To Which Control Is Guaranteed To Return’ policies will be described for partitioning a non-recurring function and a recurring function. Because the partitioning algorithms for partitioning non-recurring and recurring functions are the same for both the ‘Keep Nothing Received’ and ‘Keep Partitions To Which Control Is Guaranteed To Return’ policies, the partitioning algorithms for each policy will be considered simultaneously.
Referring now to non-recurring functioning partitioning, the present invention will not partition a loop body, where a loop occurs when two or more separate partitions may follow a particular partition.
A C language algorithm 100 for partitioning non-recurring functions is illustrated in
Next, methods and computer program products for partitioning a recurring function will be discussed. Like the partitioning of a non-recurring function, a recurring function having a loop therein ay result in control flow information leakage during transmission of the partitions from a server to a device. Therefore, the same rule applies that a loop-body cannot be partitioned. A C language algorithm 104 for partitioning recurring functions is illustrated in
It will be appreciated that the partitioning algorithm 104 for recurring functions is virtually same as the algorithm 100 for non-recurring functions, but the runtime behavior of the server side is different. For non-recurring functions, a server according to the present invention simply sends the safe partitions as requested by the client. But for recurring functions, the server will send a predetermined safe partition sequence which includes all the reduced nodes in the recurring function. However, this sequence cannot be an arbitrary sequence.
It will be appreciated that the partitioning algorithms described above with respect to
As noted above, each of the algorithms discussed herein may be implemented by the program partitioning algorithm within the server 33. Therefore, the program partitioning algorithm can effectively identify recurring and nonrecurring functions within a mobile program, and can partition the mobile program according to the methods set forth above. Given the cache policy of a device, the program partitioning algorithm can also transmit the appropriate partitions to a client device.
Although the partitioning of programs has been described in detail, it will be appreciated that another aspect of the present invention is in the partitioning of data. It will be appreciated that memory-limited devices such as smart cards contain not only limited memory available for executing programs, but also limited memory for storing data. Therefore, the systems, methods and computer program products of the present invention and described above with respect to program partitioning may also be used to effect data partitioning. In particular, using the present invention the server 33 may transmit only the data required for use by the device 42 to execute a current algorithm. To run program partitions on the client side, the data needed by the code partitions is required. Rather than transmitting the sending the whole data segment plus stack and heap of the program, which is very inefficient, methods and computer program products of the present invention only send the data accessed by the particular code partitions.
The data accesses of a partition of code can be divided into three categories: (1) non-dereferenced data accesses, which corresponds to direct accesses to locally defined variables in stack and globally defined variables in data segment (no pointer dereference is involved); (2) dereferenced data accesses to non-heap objects, in which a pointer can point to an object residing in stack or program data segment. Those objects are statically defined and allocated in the program so accurate points-to information statically for such objects are identifiable; and (3) dereferenced data accesses to heap objects: a pointer pointing to a heap object. Heap objects are allocated and freed dynamically. Algorithms 108, 110 for partitioning data in the first two categories above are illustrated, respectively, in
Next, an additional method of the present invention, the merging of safe partitions, will be explained in detail. Like the above methods, which may be implemented by computer program products, and more specifically, the program partitioning algorithm, the methods of merging safe partitions also occurs within the server 33. The merging of safe partitions may also be implemented by the program partitioning algorithm.
The algorithms disclosed above illustrated how the present invention is operable to identify minimal safe partitions under different device cache policies. According to the tamper-resistant partitioning algorithms described herein, a function body is partitioned into multiple safe partitions in such a way as to guarantee that during every invocation of the function, the sequence of safe partitions sent is identical, so as to eliminate the leakage of program control information from the differential of sequences of program partitions. Thus, the sending sequence of the safe partitions during a program execution is actually predetermined and fixed, and every time the same sequence will be transmitted. Because of this important property, adjacent safe partitions may be merged into a larger one while not compromising tamper resistance.
Merging multiple partitions reduces the transmission time for downloading programs to the device. Minimal safe partitions create inefficiencies due to the fine granularity during execution. In order to alleviate this problem, the present invention provides a novel solution that is scalable to the amount of available data and code memory on the device. This is achieved by merging adjacent minimal safe partitions under the memory capacity constraint. It is shown that doing so does not violate the tamper resistance property.
The merging algorithm (e.g., implemented by the program partitioning algorithm or a separate merging algorithm within the server) is guided by resource limitations of the device's code size limit and data size limit. Therefore, the merging algorithm takes the original minimal safe partitions and the device's code size limit and data size limit as an input. The merging of code partitions then occurs to ensure that a merged partition, which is the sum of multiple partitions, will not exceed the device's memory resources. Additionally, this merging can occur for both code and data. Therefore, the result of data merging is the union of referenced data. To effect merging, methods of the present invention find a partition of items so that the number of partitions is minimum under two conditions: (1) the partition can not reorder the items; and (2) if a single original item has exceeded resource limit by itself, it is not merged with other items.
Finally according to yet another aspect of the present invention, systems, methods and computer program products of the present invention can further optimize the ability of a device having inadequate memory to store program functions. In particular, in the absence of any mandatory requirement to keep partitions in memory, a rather large overhead may be incurred to fetch the needed partitions from the server every time they are needed. For instance, where the device and server communicate via a cellular network, these communications may become expensive. Even with safe partitions merging, a huge communication and downloading overhead can result. To reduce runtime overheads, the present invention can implement function caching in the client device. Function caching will enable a client to leave a part of memory dedicated for caching a set of functions. When the cached function is called again, client will not request it from the server but will fetch it from local memory directly. Which function(s) should be kept in the client memory at a given program point may be determined statically by the program partitioning algorithm, which is also referred to hereinafter as the compiler. A static solution is preferred because a dynamic cache eviction algorithm on a client side device is expensive.
The framework of the function caching mechanism of the present invention consists of three steps: (1) program instrumentation; (2) hot function set identification and optimization; and (3) compilation/runtime environment support. In particular, certain sets of functions, or hot function sets, are regularly called by a program during a period of time. Function caching identifies the hot function set at each call site. The hot function set for each call site is decided statically and fixed during program run. For each user-defined function call, instructions dump out the ID of the calling function, the ID of the calling basic block, the ID of the called function. In this way, a trace is generated with the information of which function is called at which program point. After obtaining the function call trace, methods and computer program products of the present invention are operable to capture patterns in the trace. Hot functions are those functions whose IDs are in high frequency patterns over a certain period.
The trace analysis algorithm then divides the lifetime of a hot function set for a trace region into three phases. For each phase, a different strategies may be applied as follows:
There are several control parameters in the trace analysis algorithm. By increasing the max hot set size longer patterns in the trace may be discovered while at the same time taking risk to introduce noise and combine multiple hot sets into one. Max misses allowed has a similar effect to max hot set size. Minimum hit frequency is a guard to filter noise in the hot set and to ensure the hot functions found are hot enough. Different programs show different calling trace behavior. These parameters allow us to find a per application balance between performance and memory requirement easily. The C language algorithm 112 of
The hot function set at each call site is the function set to be cached at that point. The to-be-cached set might be different from one point to another. Compilation and runtime environment support is necessary to enable hot function set transition. During compilation of the mobile code program, our compiler inserts a function call update_cached_function (int current_func_id, int current_BB_id) just before a user defined function call when necessary. Such a function call is necessary unless statically compiler can establish the fact that in runtime, currently cached function set at the call site is equal to the function set to be cached. Whether the two sets are equal might be unknown at a join node due to different sets being in cache on different edges of the join. The mobile program requests the runtime environment to update the cached functions through the inserted function call. When the runtime environment loads a program, it also loads a map of call sites to their corresponding hot function sets. When it receives a request, it will compare the corresponding hot function set for current call site with the functions currently cached, find out the functions to be cached but not locally available, then ask for them from server.
It will be appreciated that the hot function set to be cached at each call site is known as a result of the trace analysis algorithm. However, each call site potentially has different hot function set. To dynamically change the current cached function set to the function set to be cached at a particular call site, an updated cache function call may compute the change. This function may be implemented by the program partitioning algorithm. Preferably, the call occurs just before each user-defined procedure call and will introduce some runtime performance overhead. On the other hand, if the compiler can guarantee that the current cached function set is equal to the function set to be cached, the inserted updated cache function call is unnecessary to improve performance. Moreover, according to one aspect of the present invention, if two hot function sets are not equal, it is possible to utilize a simpler version of the call which provides the difference to runtime environment explicitly so that runtime environment doesn't need to compute the difference itself, resulting in lower cost. An illustrative example is illustrated in
In the example 114 of
After identifying the compiler guided function set to be cached at each call site, the compiler can derive the memory requirement of the program. It will first guarantee the hot functions memory requirement at each call site to achieve good performance, then it will examine the maximum size of minimal safe partitions as seen when a specific hot set is active. It takes the sum of these two as compiler recommended memory allocation size at a specific call site.
As is disclosed herein, the present invention provides efficient and tamper-resistant program partitioning for secure embedded devices (such as smart cards). The present invention provides tamper resistance in the transmission of programs to devices because there are no observable differentials in the sequences of program partitions sent through the network. The different policies of caching partitions in the device receiving program partitions impacts tamper-resistant program partitioning techniques and the performance of the device in executing functions (including memory requirements inside the device and the speed of execution of a program application). The partitioning algorithms of the present invention can partition applications into very fine-grained pieces. However, because runtime performance may be degraded if partitioning is performed without further optimizations, merging of safe partitions and function caching are two optimizations to reduce runtime overhead encountered due to program partitioning.
Many modifications and other embodiments of the inventions set forth herein will come to mind to one skilled in the art to which these inventions pertain having the benefit of the teachings presented in the foregoing descriptions and the associated drawings. Thus, it will be appreciated by those of ordinary skill in the art that the present invention may be embodied in many forms and should not be limited to the embodiments described above. Therefore, it is to be understood that the inventions are not to be limited to the specific embodiments disclosed and that modifications and other embodiments are intended to be included within the scope of the appended claims. Although specific terms are employed herein, they are used in a generic and descriptive sense only and not for purposes of limitation.


text:
When it comes to getting rid of unwanted and potentially problematic veins in your legs, laser vein treatments are the optimal choice. At Suffolk Vascular & Vein Center, the team of board-certified vascular surgeons has equipped themselves with the latest minimally invasive technologies for dealing with conditions like varicose veins. If you’d like to explore your options in laser vein treatments, call one of the three locations in Hauppauge, Port Jefferson Station, or Riverhead, New York, or use the online scheduler to set up an appointment.
The team at Suffolk Vascular & Vein Center offers the latest, minimally invasive approaches to treating problematic veins, including:
Your doctor uses laser light energy, which travels through your skin and heats up the blood vessel below the surface. The heat closes off the vein by forming scar tissue, and your blood reroutes itself through healthier blood vessels.
During this procedure, your doctor makes a tiny incision through which they thread a radiofrequency fiber. They deliver the radiofrequency energy directly into your blood vessel, which cauterizes and seals it off. Again, your blood then reroutes itself through surrounding vessels.
The doctors at Suffolk Vascular & Vein Center primarily use endovenous laser and radiofrequency ablation to address varicose veins. These bulging veins that appear toward the surface of your skin develop when valves in your veins malfunction, causing blood to pool in your legs, which leads to the ropey, spindly veins that are the hallmark of the condition.
While aesthetically displeasing, varicose veins can also be a source of considerable discomfort, sometimes causing pain and ulcers if left untreated. With laser vein treatments, you can rid yourself of these veins before they lead to larger problems.
The team at Suffolk Vascular & Vein Center performs endovenous laser ablation and radiofrequency ablation right in their offices. They typically use a local anesthetic for your comfort, but you’re free to return home afterward.
You may experience some soreness, minor swelling, or bruising after your procedure, but these side effects typically resolve themselves quickly. You can take over-the-counter medications to offset any discomfort, and your doctor may recommend that you wear compression stockings for a few days to prevent blood clots and swelling.
Your doctor gives you full aftercare instructions, but you generally don’t have many limitations. In fact, your doctor recommends that you move freely to encourage blood flow.
To learn more about the laser vein treatments at Suffolk Vascular & Vein Center, call one of the three locations or request an appointment online.

domain: medical


text:
Hey babies. It's way too early to be drawing conclusions and I'm really only doing this because there's so much time off before the next game...BUT there have been some clear themes evident through each of the Knicks' three wins and I'd like to just hash those out so we can track them from here forward. First, I recommend reading some more expert summaries of what New York has been doing. Zach Lowe, Boberta Silverman, and Matt Moore have each written on the Knicks' hot start, and all those pieces are worth a look. For a stat-heavy breakdown, I recommend Mark Simon's piece from today.
Now, here are a few specific trends from games one through three. Pretty much all this data comes from Basketball-Reference, and I'm trying to take numbers that accurately reflect production from all three games, instead of averages swayed by just one extreme (for instance, New York's rebounding numbers look weak, but that seems to be mostly because they got badly out-rebounded by the Sixers on Monday).
1. The Knicks are playing at an incredibly slow pace. This one stands out above all else. The Knicks are averaging about 89 possessions per 48 minutes, which is last in the league, and not a number that's skewed by one especially slow game or anything. Each of New York's three wins was down around there. How is this the case? I'd guess it's because the Knicks are taking excellent care of the ball (the league's fifth-lowest turnover percentage), cutting off first options with great defense, and running plenty of motion on offense before they look to score. Recall that the Knicks were near the top in pace factor last season, and also keep in mind that Philadelphia and Miami were both relatively slow teams last season (Miami's played a couple high-possession games since losing to the Knicks, but they were 15th last year), so we'll see how this changes after games against teams that want to play faster.
2. The Knicks are shooting and hitting an absurd number of threes. They've made more three-pointers through their first three games (43) than any other team in NBA history. They lead the league in attempts right now (and most other teams have played four games) while hitting 45 percent of those attempts, which is fifth overall.
3. The Knicks aren't getting to the line often, but they're shooting well when they get there. New York is 22nd in free throw attempts per field goal attempt. They've shot just 52 free throws over three games. On the other hand, New York is shooting 82.7 percent from the line so far, which is the league's third best mark.
Intermission: This is a good time to mention Jared Zwerling's piece about Dave Hopla. Whatever that magical man has done to the Knicks is working so far.
4. Inside the arc, the Knicks are shooting way better on the right side of the floor. You can find that in Simon's article. I just poked around VORPed a bit and it looks like Carmelo Anthony, Raymond Felton, and J.R. Smith are the ones contributing to that trend so far. Tiny sample, but still cool.
5. The Knicks aren't fouling much. They're ninth in free throws per field goal attempt.
6. So far, the Knicks have the league's second most efficient offense and second most efficient defense. Cool. I think it's in New York's best interest to keep that up.
So, these are all things to keep an eye on (rebounding, too, because I think the Knicks may end up improved in that department) as the season progresses. What else do y'all see? Are there other trends you've noticed, whether or not you can find numbers to confirm them? Did I terribly misinterpret any stats?

domain: sports


text:
Manchester United are attempting to sign Chelsea’s academy star Domingos Quina, according to reports.
The Red Devils are looking to bring in a host of exciting young talent with their youth academy set for a revamp.
And according to The Sun, United are attempting to pinch the 16-year-old midfielder from Stamford Bridge.
The Portuguese wonderkid has been at Chelsea’s academy since the age of 13 but is reportedly tempted by a move to Old Trafford.
Chelsea have reportedly made an approach for Real Madrid defender Dani Carvajal.
Reports in Spain claim the Spaniard is unhappy at the Bernabeu and Chelsea are willing to offer him the opportunity of regular first-team football.
Carvajal has fallen behind Danilo in the pecking order at Real and the Blues want the 24-year-old to provide competition for Branislav Ivanovic.
Spanish publication Fichajes claim Chelsea have begun talks with the La Liga giants over the possibility of a deal being agreed.
Express Sport brings you all the latest transfer news from the Premier League
Kelechi Nwakali is on his way to Arsenal, according to reports.
The Nigeria Under-17 captain has been on the Gunners’ radar for several weeks and Nigerian publication Tribune claim the youngster was flying over to London late last night.
“I am going to Arsenal to work and try to be the best I can,” Nwakali said.
“With God anything is possible, to work hard to justify my claim for first team football.”
Liverpool goalkeeper Adam Bogdan has attracted interest from French club Reims.
The Hungarian has been linked with a move away from Anfield after falling down the pecking order.
Simon Mignolet and Danny Ward have both been the selections for Jurgen Klopp’s matchday squad of late, leaving Bogdan to consider his future.
Reports suggest Bogdan is concerned about missing out on selection for the European Championships in the summer.
And according to Sky Sports, Reims have asked Liverpool if they can take the 28-year-old on loan for the rest of the season.

domain: news


The owners of Elitch Gardens have purchased additional land just south of the amusement park.
Denver-based Revesco Properties and Kroenke Sports & Entertainment paid $7.35 million last week for a 2.5-acre site in the 1300 and 1400 block of North Zuni Street in the Sun Valley neighborhood, according to public records.
The property — 1380 and 1432 N. Zuni St. and 1940, 1948 and 1950 W. 14th Ave. — is industrial in nature and vacant.
“It’s a site that I don’t necessarily have a vision for,” Revesco President and CEO Rhys Duggan told BusinessDen. “But if I didn’t buy it, five years from now I would look back and wonder why we didn’t buy it.”
Kroenke Sports & Entertainment, founded by billionaire Stan Kroenke, is the parent company of the Denver Nuggets and Colorado Avalanche. Revesco is a real estate investor and developer.
The site is one block south of Meow Wolf, the tourist attraction that opened in 2021. Its building rising above the viaducts at 1338 1st St. — “Even long-time residents of Denver didn’t know where that was,” Duggan said — was developed by Revesco and Kroenke.
North of that is Elitch Gardens. Kroenke and Revesco purchased the business and its real estate in 2015, and plan to eventually move the park and redevelop the site into a new neighborhood named River Mile.
Separately, Kroenke also owns the Pepsi Center, where the Nuggets and Avalanche play, and wants to redevelop the sea of parking lots that surround the venue. The River Mile and Pepsi Center sites, separated by railroad tracks, are about 115 acres combined.
The property along Zuni Street was sold by the Siegel family, which operated a petroleum distribution business at the site for years before selling it to a firm called Diesel Direct in 2017, according to a news release from the sellers. Evan Makovsky, Dorit Fischer and Hayden Hirschfeld of NAI Shames Makovsky represented the sellers.
Parcels within the site have two different zoning classifications, for industrial use and for mixed-use projects up to five stories. Duggan said he’s marketing the existing industrial buildings for lease for now.
“We’ve had a lot of interest from entertainment groups that want Meow Wolf proximity,” he said, although no deal has been signed.


text:
Roasted bell peppers are seasoned with olive oil, oregano and crushed red peppers. Roasting bell peppers really brings out their flavor. Delicious!
Look at these gorgeous, colorful roasted bell peppers! They are as flavorful as they are pretty.
I love raw bell peppers. I slice them thinly, and sprinkle with sea salt and oregano. Yum.
But as much as I love bell peppers raw, I find that roasted bell peppers are even better. Roasting really brings out their unique flavor.
These roasted bell peppers are seasoned with olive oil, oregano and crushed red peppers. They make a wonderful side dish to meat, poultry or fish. I make this dish often, because it’s so easy to make, and because I almost always have bell peppers in the fridge – they keep well and don’t spoil as easily as other produce.
I often serve these roasted bell peppers with baked chicken breast, because they both require the same oven temperature and the same roasting time. Can you say EASY? It’s the perfect weeknight meal!
It’s unlikely that you’ll have any leftovers, but if you do, these roasted bell peppers keep well in the fridge for several days. Gently reheat them in the microwave, or do as I do and eat them cold the next day for lunch, with deli meats, cheeses and hard boiled eggs – they make a great antipasti plate!
Roasted Bell Peppers
- 4 medium bell peppers
- 2 tablespoons olive oil
- 1/2 teaspoon kosher salt
- 1/4 teaspoon black pepper
- 1/2 teaspoon garlic powder
- 1/2 teaspoon dried oregano
- 1/4 teaspoon red pepper flakes
- Preheat oven to 450 degrees F. Line a rimmed baking sheet with parchment paper.
- Cut the bell peppers into quarters, then seed and trim them.
- Place the bell peppers on the prepared baking sheet. Drizzle with the olive oil and use your hands to coat them well.
- Sprinkle the bell peppers with salt, pepper, garlic powder, oregano and red pepper flakes.
- Roast until tender and charred in spots, about 20 minutes. Serve the roasted bell peppers immediately.

domain: food


text:
The attention price Calculator determines interest that is real on loans with fixed terms and monthly obligations. For instance, it may calculate rates of interest in circumstances where vehicle dealers only offer payment per month information and total cost without like the real price regarding the auto loan. To calculate the attention on a good investment alternatively, utilize the Interest Calculator, or utilize the Compound Interest Calculator to comprehend the essential difference between different interest levels.
What exactly is Rate Of Interest?
Rate of interest may be the quantity charged by loan providers to borrowers for the usage of cash, expressed as a portion regarding the principal, or initial quantity lent; it’s also described instead while the expense to borrow cash. By way of example, an 8% interest for borrowing $100 a will obligate a person to pay $108 at year end year. As can be viewed in this brief instance, interest directly impacts total interest paid on any loan. Generally speaking, borrowers want the cheapest interest that is possible since it will definitely cost less to borrow; conversely, loan providers (or investors) look for high interest levels for bigger earnings. Rates of interest usually are expressed yearly, but prices may also be expressed as monthly, daily, or just about any other duration.
Rates of interest get excited about practically all lending that is formal borrowing deals. Samples of real-world applications of great interest rates consist of home loan prices, the fee on an individual’s outstanding financial obligation on credit cards, loans to invest in money jobs, the growth of your your retirement funds, amortization of long-lasting assets, the discount provided by a provider to a customer for paying down an invoice previously, and far, a whole lot more.
Simple Vs Compound Interest
There are two main methods for calculating interest. Simple interest percentage is calculated as a share of principal only, while compound interest rates are calculated as a portion the main along side any accrued interest. Because of this behavior that is compounding interest received by lenders later earns interest with time. The greater usually interest substances within a offered time frame, the greater amount of interest shall be accrued. Most formal interest repayment calculations today are compounded, including those with this calculator, and any following reference to interest will make reference to compound interest in place of easy interest unless otherwise specified. To complete calculations or find out more about the distinctions between compounding frequencies, please go to the Compound Interest Calculator.
Fixed Vs interest that is variable
Fixed rates are prices which are set being a percentage that is certain the life span regarding the loan and certainly will perhaps not alter. Adjustable prices are interest levels that may fluctuate in the long run. The amount of variance is usually based on facets such as for example another rate of interest, inflation, or an industry index. You will find various advantages and disadvantages every single, however the rate of interest Calculator is only going to show the effect as being a fixed interest.
Interest for several forms of loans is frequently marketed being a apr, or APR. APRs are generally utilized within house or contexts that are car-buying consequently they are slightly distinctive from typical rates of interest for the reason that specific charges could be packaged into them. As an example, administrative costs which are often due when purchasing brand new automobiles are typically rolled to the funding associated with loan, rather than compensated upfront. APR is an even more accurate representation than rate of interest when you shop and comparing similar competing. Having said that, yearly portion yield (APY) may be the interest that is acquired at a lender, frequently from a checking account or certification of Deposit (into the U.S.). To find out more or to complete calculations involving APR, please look at the APR Calculator.
Uncontrollable Economic Aspects that Affect Interest
You will find many facets that affect what interest levels individuals log in to direct lender payday loans no teletrack 100 approval in indiana their mortgages and automobile financing. Although these mostly is not managed, having familiarity with these facets may nevertheless be helpful.

domain: finance


text: stephanie likes orzo. no, she lurves it. so i made orzo, cooked it al dente in stock and let it sit to cool, sucking up most all the liquid. i softened chopped fennel, pan roasted a nice piece of halibut in high oil and let it rest on the fennel. we had yesterdays pesto, which got darker in flavor, but mixed well with the orzo. incidentally, if you’ve got a whole bunch of basil, pine nuts and good olive oil you might as well make enough pesto to keep. it freezes well, if you omit the parmesan, you can always add the cheese midwinter when you might want to make use of your treasure on some cold snowy night.


text:
Visual Basic Express Pre-empt bidding and playing logic has been enhanced. Download and use it now: This classic Canasta game plays in Windows. If you require the software on more than three computers, you must purchase additional copies.
|Date Added:||16 October 2018|
|File Size:||19.65 Mb|
|Operating Systems:||Windows NT/2000/XP/2003/2003/7/8/10 MacOS 10/X|
|Price:||Free* [*Free Regsitration Required]|
BRIDGE Card Game From Special K 4.9 Details
Icons and fonts are really large even in FHD display it really looks well. Click here to review our site terms of o. If you require the software on more than three computers, you must purchase additional copies. Use Windows to achieve the realistic atmosphere of a Bridge game with animation and sound.
In a bridgw you are able to comprehend when and what kind of Level is under a threshold. They offer over games, available anywhere at any time! Neil Maloney has written a description of terms used in Play against the computer playing between 1 and 5 opponents. Better keyboard support makes playing easier.
Your village is under massive attack from a hostile country. The card game of Bridge ver 4. You can choose from different bidding conventions and styles of play.
It is distinctive in being a three handed game, however it is often played by four people, with the dealer sitting out each round.
The Holy Bible King James Microsoft 3D Pinball - Bride Play Spider Four Suits and four other spider solitaire card games. The game shares the same objectives as all Rummy games - to meld your cards into groups of three or more cards of the same rank, but in Canasta sequences are not allowed. Laws concerning the use of this software vary from country to country.
BRIDGE Card Game From Special K Free Download
All deals are perfectly random, so you can play an infitie number of hands. You can even make up your own game! This computer version has customizable settings so that it is a challenge to new and experienced players, while maintaining all the enjoyment of the original.
Your payment is secure on PayPal, and you do not even need an account. Please keep a backup copy of the registered bridgee, which you must not distribute outside of your immediate family. That popular card game of Bridge ver 4. You can skip this in seconds Click here to continue. Speciql and other games rules - a good site for rule and logic The House Of Cards - a great resource for all card games Wikipedia - the classic resource top of page.
The card game of Whist ver 3.
Pagat - Great card game site for all card game rules. Thank You for Submitting a Reply,! Better keyboard support makes playing easier.
It comes complete with a help file and on screen explanation of the bidding logic. Windows Media Player Brunswick West VictoriaAustralia. This popular game plays in Windows, and has a real time explanation of what bids mean as well as an extensive help file, so is ideal for beginners and experts.
The game developed from Whist, and in particular a apecial called Russian Whist.

domain: game


text:
Our biennial Staff Conference was held this year in July at Stoney Ridge Campsite. The theme was “Back to School – Enabling for Impact”, with the focus was on how we, as staff, can enable volunteers to really impact young people in South Africa.
We spent several of our sessions looking at various things we do in schools, as that is where lots of young people spend lots of their time! One of the learnings that came out of many of the sessions was that we need to start on the inside. In other words, if we want young people to engage with the Bible, we must be engaging with the Bible; if we want them to live healthy Godly lives, we need to be living healthy Godly lives; if we want to train volunteers well, we must be well-trained. It was a great challenge for all of us! Most of the sessions were taken by staff members and involved lots of interaction and discussion. Chililza Nkabinde (a past manager of Stoney Ridge Campsite) was our plenary speaker and even the electives were led by staff or past-staff! It was great to have such a “family feel” and to learn from people with experience.
Now to put it all into practice…
Click here for more pictures from the SU Staff Conference Photobooth

domain: sociology


Press center menu
Commissioning tests of drying system for uranium compounds suspension (yellow cake) start at JSC Dalur main facility
The processing line was purchased from Susarny Praha s.r.o., based in Czech Republic, and the project was developed by JSC VNIPIpromtechnologii, operated by ARMZ Uranium Holding Co. The equipment has been manufactured with account of JSC Dalur requirements to its installation in the existing production premises. The system mounting took a little over two months.
“In spite of specific nature of activity of ROSATOM State Atomic Energy Corporation’s mining arm, it’s safe to say that we are consumer-oriented like any other company. The end product is delivered to enterprises operated by JSC TVEL, a fuel producer for ROSATOM State Atomic Energy Corporation. Moisture content in uranium compounds suspension that we were able to provide earlier equaled up to 30%. After implementation of this advanced drying technology moisture content will decrease to as low as 2%. Thus, we will not only reduce logistics costs but will also facilitate further processing,” explains Nikolay Poponin, JSC Dalur Director General.
First results of the tests have proved that the process flow is sustainable and safe. The use of front-edge filtration systems and a WS scouring machine fully rules out possible damage to the environment. Dry concentrate capacity of the new system will amount to 120 kg per hour, which corresponds to JSC Dalur production volumes, with account of higher development volumes at the Dalmatovskoye and Khokhlovskoye fields. The enterprise is planned to achieve uranium output of 600 tons of uranium per year.
Following the results of operation of the uranium compounds suspension drying line at JSC Dalur, ARMZ Uranium Holding Co. plans to examine the possibility of purchasing similar equipment for JSC Khiagda, which operates uranium deposits, located in the Bauntovsky District of the Republic of Buryatia, using the downhole in-situ leaching method.


text:
This Honda Civic Commercial Has A Super Catchy Song And Great Visuals
January 3, 2016 2 Comments
“The Dreamer” has some really cool, engaging visuals based on the imagination of a Honda Civic designer. And that catchy song is “Walking on a Dream” by Empire of the Sun. A very nice ad from Honda.

domain: artistic


text:
Having health insurance helps keep you and your family healthy, and can prevent out-of-pocket health care costs.
Scott County Health Department staff can help you connect with the following health insurance programs:
– free or low-cost health insurance for the children and teenagers of working Iowa families.
– is temporary Medicaid health insurance that starts the same day that you apply. while you wait for ongoing coverage.
EPSDT Care for Kids
– can help local families on Iowa Medicaid and Hawki with connecting to additional insurance and resources.


text:
Hermes Airports is delighted to welcome the launch of SWISS flights from Geneva to Cyprus. Swiss International Air Lines (SWISS), which is part of the Lufthansa Group, will connect Larnaka with Geneva, Switzerland. The route was inaugurated on July 3, 2019 and will be operated on a weekly basis every Wednesday; Additionally, during September and October, the route will operate every Saturday.
The launch of SWISS’ flights to Cyprus is expected to contribute to the efforts to strengthen the connectivity between Cyprus and Switzerland; it is estimated that the airline will transport approximately 4,000 passengers to and from Cyprus during the Summer season.
The inaugural flight which landed at Larnaka Airport was received with a water arch salutation, customary for inaugural flights, whilst a welcoming event was organised for the arriving passengers of the flight.
In a statement, Senior Manager Aviation Development Maria Kouroupi, welcomed the launch of SWISS flights to Cyprus, and noted that this development is the result of the targeted actions and efforts made by Hermes aiming to further increase the connectivity of the country. “On our part, I wish to reaffirm the ongoing commitment of Hermes to the joint effort of boosting and developing the tourism industry of Cyprus”, she concluded.
Lorenzo Stoll, Head of Western Switzerland for SWISS, said, “With the opening of the Geneva-Larnaka route, SWISS is now offering its network a new destination from Geneva. In this way, we give our passengers the opportunity to discover the beauty of this wonderful region, and the passengers of Cyprus to discover Switzerland. We are delighted with this imminent opening”.

domain: travel


text:
Deuteronomy 5:20-22 21st Century King James Version (KJ21)
20 “‘Neither shalt thou bear false witness against thy neighbor.
21 “‘Neither shalt thou desire thy neighbor’s wife, neither shalt thou covet thy neighbor’s house, his field, or his manservant, or his maidservant, his ox, or his ass, or any thing that is thy neighbor’s.’
22 “These words the Lord spoke unto all your assembly in the mount out of the midst of the fire, of the cloud, and of the thick darkness, with a great voice; and He added no more. And He wrote them on two tablets of stone, and delivered them unto me.

domain: literature


text:
Unknown festival review
As long as blue skies remain more a British summer hope than expectation, the allure of the foreign festival looms ever larger in the collective imagination: why toil in the trenches of Glastonbury drinking £6-a-pint perry when a couple of hours from your short-haul airport of choice there lies a festival Eden where the money’s different enough that it doesn’t feel like you’re spending it, the beer’s served in session-friendly halves and sunrise is a thing to embrace, not dread?
At least that’s the theory – and nowhere more so than at Unknown, a festival at an upmarket beach resort a mile up the shore from a scruffily beautiful fishing village in northern Croatia, among enchanting forests and craggy coastline. At Unknown, though, it’s a whole week of abandon rather than just a weekend – a Monday-to-Friday rave that takes the slow-and-steady approach to losing your shit: DJs play out leisurely by the pools at the start, and five days later you’re hugging strangers in a woodland clearing. Indeed, the entire festival is geared towards being a marathon not a sprint, and as I arrive in 35° heat on Monday afternoon, the slow pace is a godsend.
That said, my first glimpse of Unknown’s central hub feels more like the location for a BBC Three documentary than any mythic Shangri-La. In front of a beach bar, two luxurious infinity pools are hosting an entanglement of waxed-chested boys in pink shorts and orange girls in denim hot-pants, while a pair of anonymous DJs deliver student union-friendly classics. By no stretch is this scene cool or subversive, but as night falls and the DJs begin throwing out chart-friendly house and club classics to the reddened masses still in their swimwear, there arises a sort of off-the-leash majesty to proceedings, a pungent sense of anticipation: “this is going to be the best week of my life”, I overhear one lad proclaiming to his mates at the bar, and the bare fact is that he could well be right.
On day two, I take in an island party. These are one of Unknown’s power-up attractions where you pay a little extra to be whisked off with 100 others for an afternoon on a volcano-shaped island twenty minutes out to sea, upon which are already marooned some of the world’s best DJs. Waiting for the water taxi there in the baking midday heat I meet Gordon. Gordon hasn’t been to bed yet, but despite that he remains chatty, telling me with meticulous and close-quartered insistence about how Daniel Avery and Erol Alkan are about to blow our minds. Unfortunately, by the time we make land the sun has sapped Gordon’s energy – and everyone else’s – and it’s not until it hangs lower in the sky that the party really gets going. From then on, though, Avery does his Orbital-meets-burbling-acid-house thing with aplomb, and the setting is heavenly: perched atop a Tracey Island idyll, and counting myself among a tiny minority of people who still have their top on, I watch the sunset to crisp techno. A muddy dance tent in the West Country is scarcely imaginable.
Meanwhile, back on the mainland, the festival’s only live stage is up and running. The Unknown site is essentially an outdoor superclub, with four separate DJ areas curating nightly bills of varying subtlety and popularity, and the result is that each evening’s live line-up feels more like an added bonus before the fun really starts than a star draw in itself. Accordingly, when Nile Rogers, arguably the greatest living hitmaker, strides on stage with his militarily drilled Chic Organisation band and delivers two hours of bulletproof disco pop, the awe that his songs command is heightened by the sheer unexpected euphoria. Indeed, so rapturously is the parade through the last 35 years of Rogers-helmed dance music that by the time of the stage invasion encore, no one has noticed that it’s started to spit. However, the weather soon disintegrates into downpour, and while DJ Harvey’s delightfully errant set of space disco and snapping techno does its best to deny the elements, there’s no avoiding the washout that persists until the afternoon of day four.
With the site now a far more familiar British quagmire I set sail again, this time on one of Unknown’s boat parties, another add-on that takes 100 or so seafarers on a six-hour cruise around the bay while DJs entertain above deck. As with the island parties, there’s a sense that the boat trips live or die not just on the strength of the performers but also the enthusiasm of the crowd, so when our boat is commandeered by the festival’s entire Scottish contingent, all of whom seem to know that day’s host collective Tweakaholic (the wedding DJ alter-ego of Glaswegian Jackmaster and two of his prankster Weegie mates) personally, there’s a palpable sense that things are likely to get quite daft for the next few hours. And lo, the tone is set as we cast off to the strains of Enya’s Orinoco Flow and the assembled mass of Yes voters belt “sail away, sail away, sail away!” to the vanishing harbour. What follows is an evening of joyous, exquisitely crafted silliness: Tweakaholic’s carefully navigated populism – they play songs you know, sure, but also plenty that you’d completely forgotten existed – combined with their deceptively skilful mixing generates an irresistible lightness and bonhomie that’s so often missing from the clubbing experience. Very simply, theirs is a set to grin to, and as the rain clears and the SS Irn-Bru bobs around the Adriatic to Luther Vandross and Ce Ce Peniston, all gorgeously mixed with flair and humour, it’s hard to recall a more jubilant way to listen to dance music.
Back on dry land later that night, Simian Mobile Disco’s sunrise set is a valiant and stirring blast of big-room electro that eventually spirals into delicious Balearic hippie wig-out, and the following evening Disclosure close the entire festival with a DJ set that rather graciously presents all the club classics they so expertly pilfered for their earth-conquering debut album. Despite the returning soft drizzle and expending stamina, the hedonism of day one has clearly endured for enough of the Unknown faithful: in the queue for the transfer back to the airport the morning after, I overhear another lad, who may or may not have been the same one from day one. “Best week of my life,” he enthuses. Turns out he was right all along.

domain: geography


text:
The Simon Gallery
54 Main Street Vineyard Haven, MA
The Simon Gallery in Vineyard Haven is open under new management. Peter Simon photographs, books and calendars are available for purchase, as well as Ronni Simon’s jewelry and sculptures.
You can also call Ronni Simon at 508-325-2242 or email email@example.com for more information and/or to set up a private appointment in Chilmark.


$300 won't quite buy you a brand new Turkish Charles Daly gas semi automatic shotgun at Wal Mart, but it does come very close.
Provided that B2000 is in nice shape, $300 is a screaming bargain. I own one, with three barrels, and it's an absolute jewel of a shotgun. It reminds me of a Swiss watch. The damn things cost more than three hundred bucks brand new back thirty years ago, with one barrel, not two.
They are supposed to even be able to shoot steel shot, except for the largest sizes. Brand new old stock spare barrels are available, cheap, from Jeff's Outfitters. Parts are still available from Gun Parts. Mine only likes the standard ounce and a eighth 3 dram trap loads, but it's so "new" it's really not broken in yet.
I promise you that $300 won't touch anything else even remotely comparable in quality.
I love mine. Its one of the better shotguns I have shot. One think to look for is if someone has had the barrel off and let the bolt hit the receiver. There will be a dent infront of the bolt handle. Its not very noticable but might give you some wiggle room on price if is it dented. I too recommend Jeffs outfitters for b2000 barrels. Barrels are great and affordable.
The rabbit slayer
I have several b2000's and love them. I would rather shoot them than any other semi auto. If you have any trouble with it cycling loads send it to midwest gun works. They have a few tricks to tighten the fit of the barrel ring to the mag tube. I have shot thousands of round with many different loads though mine since these adjustments with no failures. I do have the same issue with one of the forearms and if you can find a new forearm it will correct it.
Good guns Yes! but shell length appears to make a difference with my two. They don't like any 65mm or 67mm cases. Forend could be cracked, glue and back up with glassfibre. Forend new from Numrich, stocks new from Jeffs Outfitters other spares from Western Gun Parts. Now take it out and shoot it, and forget all about chokes, if your in the right place it's a kill and if not who cares you will get it next time. Best of luck Richard. PS I bought three barrels from Jeffs and have had had some of the choke taken out of a couple, but I shoot best with the skeet barrel so much for who cares!
When you do don;t be scared of the side loading, it woorks really well, when you have mastered it. If your right handed, hold the gun in your right hand with the bolt open, saftey on and finger off the trigger. Now push a shell in to the loading port, with the left hand, don't push it all the way in, but let it rebound on to the carrier latch trip. Tha shell will be speed feed into the chamber. Now load up the magazine through the port, the last shell will sit on the carrier latch and be full visable. The last shell is quite happy here and will not fall out and feeds OK. All the shells from the magazine can be pulled out off the loading port to empty the gun, just remember to lift the cartridge stop to let them out of the tube. If you don't fancy the speed load you can drop a shell in the ejection port and trip the latch from underneath the gun, them load up the magazine through the loading port. Please let us all know how you get on with the gun. I am a fan of it. Regards Richard.
1 - 11 of 11 Posts
This is an older thread, you may not receive a response, and could be reviving an old thread. Please consider creating a new thread.
A forum community dedicated to Shotgun owners and enthusiasts including the Remington, Beretta, and Mossberg shotguns brands. Come join the discussion about optics, hunting, gunsmithing, styles, reviews, accessories, classifieds, and more!


INDIANAPOLIS–A cold front will move through Indiana late Wednesday night and rain is supposed to return.
“It’s looking like we’ll see anywhere from a quarter of an inch of rainfall to as much as a half-inch. Some locations could get three-quarters of an inch of rain,” said David Beachler, meteorologist with the National Weather Service in Indianapolis.
Beachler believes the bulk of the rain is going to fall during the daylight hours on Thursday.
“There appears to be a narrow window of rain, but there is the potential that some of that could bring brief, heavy downpours. As well as that, we’re anticipating gusty winds. It looks like winds will be gusting out of the south at about 25 to 30 mph,” said Beachler.
Beachler does not expect the weather to be severe at this point. He expects the temperatures to drop in the coming days.
“We’ll have a few days over the weekend where the temperatures are in that cool category. It does look like we’ll warm up just a little bit as we go into next week. The above normal conditions we’ve experienced don’t appear to be playing much of a role over the next couple of weeks,” said Beachler.
He says even if high temperatures get into the 60s for a day or two, they will go back down into the 50s and 40s.
- Pacers GM: Contract Extension Talks with Buddy Hield Are “At a Halt” But That Doesn’t Mean They’re Done
- Murder Suspect Kevin Mason Captured
- NWS: Expect a Rainy Wednesday Across Indiana
- Pence: Trump Owes it to the American People to Debate
- FOUND: Momo the Monkey on the Loose: Indianapolis’ East Side on High Alert
The Dangers of Brown Friday & How You Can Prepare for the Worst
Feds, Rush County Sheriff Search Home In Valerie Tindall's Disappearance
Indiana State Police K9 Koda Receives Life-Saving Armor
Indianapolis Firefighter Among More than 20 Arrested in Child Solicitation Sting
Big Ten Championship Game's Future in Indianapolis Uncertain After 2024.
Kendall And Casey
Man Charged with Murder, Body Found During Investigation Into Missing Rush County Girl
A new Buc-ee's will be less than 2 hours from Indy


text:
Alexandr Valentinovich Makhnach is Candidate of Science (Psychology), Leading Research Officer at the Institute of Psychology of the Russian Academy of Sciences (Moscow).
The medical and social models are compared; the legitimacy of the paradigm shift studies and the emergence of the social model in the majority of social sciences and medicine are justified. Model of health (social model) is based on the principle of equality of all: people with the special needs and the ordinary people. The coexistence of two approaches: from the perspective of the deficit (medical model) and health (social model) - is considered on the example of the phenomenology and discourse of the orphanhood. Orphanhood in the medical model describes the environment of the orphans themselves in terms of "syndromes" and "symptoms" of unfavorable life situations, which leads to the reproduction of the circle of disadvantage. The shift away from the medical model in favor of the social one relates to a certain degree to phenomenology of the orphanhood. The emergence of health psychology is regarded as a departure from the medical model to the research and treatment of human resilience. The social model as a precursor of the resilience research was analyzed. The operationalization of the "resilience" concept was made. There have been presented four aspects of the ecological model which provide the results of the undertaken research. Factor structure of resilience is described within the framework of four factors: "Relationships", "Subculture", "Community", "and Personality characteristics". Relationships are considered as the most important resource for the resilience of teenage orphans.
Key words: medical model vs social model, operationalization of the "human resilience" concept, resilience of the orphans, the factor structure of resilience.
Link to full text of this number of journal: Full text PDF


Log In / Sign Up
By bridging the gap with companies that are hiring.
Users can now reach out to models, ambassadors, bloggers, and more for promotions and endorsements.
To create new opportunities for investment, partnerships & collaborations.
Due to legacy operational procedures and business systems, many struggle to make the transition to adopt newer technolog...
A program focused on providing market expansion and soft-landing for aspiring and established entrepreneurs.
Growth Hacking Venture Capital Working Spaces Logistics Software Expansion Series B Journalism Technology Development Photography Innovation Bridge Round Incubators South East Asia Marketing Series A Accelerators Social Enterprise Failure Down Round Angel Investor Hardware Investment Mobile Market Access Funding Digital Hub App Internet Media Seed Asia News People Gadgets Support Startup


text:
The Surfing WordPress Theme by WpMania.Net is a meticulously crafted theme tailored for those passionate about surfing and other water-based activities. This theme is not just visually appealing but also comes packed with features that make it stand out in the crowded digital space.
- One-Click Demo Import: Get your website up and running in no time with the one-click demo import feature.
- Fully Responsive: Ensures your website looks impeccable on all devices, from desktops to mobiles.
- SEO Friendly: Clean, optimized code ensures better rankings in search engine results.
- Fast Loading: Designed to be lightweight, ensuring quick load times for your visitors.
- Visual Builder with Elementor: Customize your website visually without any coding knowledge.
- Direct Support: Get assistance directly from the theme creators whenever you need it.
- eCommerce Ready with WooCommerce: Set up your online store effortlessly with WooCommerce integration.

domain: design


As California’s population continues to age, state officials are urging residents to do something human beings frequently find agonizing: Plan for that time in their twilight years when they may need assistance getting out of bed, visiting the bathroom and dressing themselves.
That’s the impetus behind the five-month-old website www.RUReadyCA.org, which is managed by the California Partnership for Long-Term Care, a joint venture of the state Department of Health Care Services and a trio of insurance companies that sell long-term care policies in the state.
The department had long published a website on long-term care coverage for insurance agents and consumers. But the newer site is aimed just at consumers in hopes that many more will realize — even in a time of tight household budgets — that they should spend money now to handle medical expenses that may not arise for 10, 20 or more years, if ever.
“It’s been a challenge to really get the word out and make sure that (Californians) understand all of the complexities of long-term care,” said Brenda Bufford, the partnership’s chief.
Long-term care insurance helps defray the cost of in-home support services and nursing home care, which are not generally covered by regular medical policies and only in limited ways by Medicare. Medicaid (or Medi-Cal, as it’s known in California) typically covers nursing home bills, but usually requires beneficiaries to first exhaust most of their financial assets.
Still, long-term care frequently remains off the radar screen of most adults because of its cost, in many cases above $100 a month, and because it’s unlikely to be needed in the near future.
Enter RUReadyCA.org. The result of focus groups and other consumer research, and accompanied by pictures of smiling or pensive 50-somethings, the website describes long-term care insurance, what services it generally covers, how much it costs, and where it can be purchased. It offers videos of Californians discussing various aspects of long-term care. And it includes calculators that estimate insurance premiums and how much money a consumer would need to stash away, in lieu of buying insurance, to help cover long-term care expenses in the distant future. (The answer: A lot.)
“We never want to think about the possibility that we’ll one day need help with getting dressed, eating or bathing,” the site declares. “But when daily activities become difficult and you or a loved one need long-term care because of a chronic physical condition such as arthritis or Parkinson’s disease, or a degenerative mental disease such as Alzheimer’s, who will pay for this care?”
In somewhat obscure fashion, the site also describes consumer-friendly features of long-term care policies that only companies enrolled in the California partnership can offer.
For example, partnership policies must allow for a 5 percent increase in benefits, compounded annually, to compensate for what officials expect will be 5 percent annual growth in long-term care costs. (Over the last three decades, such expenses have risen between 5 and 6 percent a year, Bufford said.)
Thus, a partnership policy that would pay out $260 a day when first purchased in 2012 will provide $690 a day in benefits 20 years later, according to the state. A non-partnership policy without inflation protection might continue to pay $260 a day after two decades.
Partnership policies also require a third party unaffiliated with the insurance carrier to assess policyholders seeking benefits, as well as their plan of care. The insurer is required to follow the evaluation’s conclusions, though it can seek a second opinion from another independent party.
“Asset protection” is an exclusive feature of partnership policies: Each dollar the policy pays out in lifetime benefits entitles the policyholder to hold onto a dollar of his or her assets when later seeking Medi-Cal coverage. In other words, if a partnership policy caps lifetime benefits at $200,000, and a policyholder exhausts that coverage and then applies for coverage through Medi-Cal, $200,000 in assets are shielded from Medi-Cal’s standard eligibility requirement that almost all assets be liquidated first.
“That’s kind of what distinguishes the partnership policies from other policies,” said Brian Millsap, vice president of product management for long-term care with Bankers Life and Casualty, a unit of CNO Financial Group. “It makes sense to have the policy available for (customers) that gives them…that Medicaid asset protection on the back end rather than only offering ones that don’t have that feature.”
Partnership companies must win approval for rate hikes – which are capped at 40 percent — from both the state Department of Insurance and the partnership office. If approved, the increase must be spread equally over three years. On the other hand, partnership policies tend to be more expensive than non-partnership versions, Bufford said.
Only three firms — Bankers Life, Genworth Financial, and New York Life Insurance – and CalPERS currently offer partnership policies in California. John Hancock expects to “soon” restart selling policies in California, a spokeswoman said.
More than a dozen other insurers offer stand-alone, non-partnership policies in the state, according to Dave Althausen of the insurance department. Currently, close to 660,000 long-term care policies are in force in California, he added.
That number should be much higher, say long-term care advocates. They point to sobering facts: Life expectancy is growing, and the number of California residents age 85 and older — those who are most likely to need extended care at home or in nursing homes — is likely to more than double by the year 2030, when the bulk of baby boomers will reach advanced age, according to the California Health Foundation.
And the cost of long-term care is unlikely to recede. According to the partnership website, the average daily private pay rate for nursing facility care in Los Angeles County currently is $206. In San Diego, it’s $240; San Francisco, $272; Sacramento, $232; and in Fresno, $213.
Long-term care advocates said the website should help jump-start conversations among more Californians about planning for their future care needs. Sean Coffey, a policy specialist at the National Center on Caregiving in San Francisco, said the site’s tips on buying long-term care insurance were helpful, though it lacked definitions of such bureaucratese as “average daily benefit.”
He also pointed out an irony: The website states that the majority of long-term care is provided by relatives, and provides a link to 11 Caregiver Resource Centers, which assist those who provide care to family members. However, as Coffey noted, Gov. Jerry Brown’s proposed 2012-13 budget would eliminate funding for the caregiver centers and make big cuts in the In-Home Supportive Services program, which would impact 254,000 recipients whose household tasks are frequently handled by family members.
Herbert A. Sample is a freelance writer based in Los Angeles. He can be reached at firstname.lastname@example.org.
This article was updated to correct the first name of Brenda Bufford.


text:
Second Sale Ava crossbody-Terracotta (Vegan)
Portion of all profits are donated to 'The Areeya Foundation'
- This bag has slight discoloration in seagrass
This handwoven seagrass crossbody purse features a faux leather strap and cover in terracotta color and comes with a genuine leather hook tassel.
9" W x 6.5" H x 5"D
Straps Drop: 20" (adjustable)
- In-house design
- environmentally friendly water resistant protective coating
- inner lining: high quality yarn-dyed 100% cotton
- inner pocket with zipper
- Vegan leather
*Because each piece is individually hand woven and made, there may be slight variations in color, dimensions and texture.


text:
Jamey's Restaurant Style Beef and Broccoli
This is my husband's new favorite. I don't think we will be going back to our favorite Chinese food restaurant any time soon. Very easy. Makes four large adult servings. I made egg rolls off this site and steamed white rice as sides. YUM!
Recipe Summary test
Some make-ahead tips: Cut up all the vegetables and beef and store in fridge. The rest will be easy and a quick after-work throw-together.


text:
Chimarrao style yerba mate. Nativa is the denomination for mates that were originated by birds spreading seeds thru the forests, in a natural way. Vacuum packed for maximum freshness.
Erva Mate Lago Verde is located in Ilopolis, knows as a center of Yerba Mate lands and production in the south of Brazil.
Vacuum packed, maintains its quality for up to 2 years (while sealed).


Information on the alignment requirements for the HVAC Program
CIP Code: 47.0201
CIP Name: Heating, Air Conditioning, Ventilation and Refrigeration Maintenance Technology/Technician
Definition: A program that prepares individuals to apply technical knowledge and skills to repair, install, service and maintain the operating condition of heating, air conditioning, and refrigeration systems. Includes instruction in diagnostic techniques, the use of testing equipment and the principles of mechanics, electricity, and electronics as they relate to the repair of heating, air conditioning and refrigeration systems.
The HVAC Alignment was originally approved by the Kansas Board of Regents on February 13, 2013. After going through the realignment process, the Technical Education Authority approved the amended HVAC alignment on January 26, 2023. Colleges are granted one academic year from the approval date to implement the alignment. Implementation of amended alignment must be completed by Fall 2024.
STATE BUSINESS AND INDUSTRY COMMITTEE RECOMMENDATION
The Business and Industry Committee recommend including the Technical Certificate A exit point as a non-credentialed exit point, which would allow students to obtain sufficient knowledge for entry level employment. The Technical Certificate A would require all Common and Support Courses. The committee recommends the program have a choice of a Technical Certificate B or Technical Certificate C as the next exit point. This would allow students to obtain enough training to sit for industry certifications through North American Technician Excellence (NATE), HVAC Excellence, or National Center for Construction Education and Research (NCCER).
The Business and Industry Committee agreed that institutions could edit the program name to include “Refrigeration” and/or “Climate and Energy Control” depending on local B&I recommendations. However, the acronym “HVAC” must be included in the program title.
ALIGNMENT MAPClick here (pdf)
Common Courses (8 credit hours)
Common Courses serve as potential articulation and transfer of coursework between secondary and postsecondary partners. These courses shall have the same title, credit hour allocation, and competencies. Institutions may add additional competencies based on local demand. The sequencing of common courses is determined by the institution.
|4 credit hours (pdf)
|Heating System Fundamentals
|3 credit hours (pdf)
|1 credit hour (pdf)
Support Courses (5-8 credit hours)
Institutions may use existing course titles for Support Courses that adhere to the agreed upon course length and competencies.
|3 to 4 credit hours
|Safety Orientation/OSHA 10 or 30
|1 to 3 credit hours
|1 credit hour
To learn where this program is available in Kansas, visit the Kansas Career Technical Education Program Search.


text:
Stop the Execution of Troy Davis: Solidarity Rally in Austin!
Troy Davis was sentenced to death in Georgia for the 1989 killing of police officer Mark Allen MacPhail in Savannah, Georgia. His sentencing was in spite of the fact that there was no physical evidence linking him to the crime, nor was a murder weapon ever found. He was convicted solely on the testimony of 9 witnesses.
Seven of these witnesses have now recanted their testimony and several say they were pressured by the police to identify Troy as the shooter. One of the remaining witnesses was Sylvester Coles, who was initially a suspect and in fact admitted he was carrying the same caliber gun used in the murder half an hour before the slaying took place.
Troy has spent the last two decades on death row for a crime he did not commit. He has faced three execution dates and is now facing his fourth date on September 21st. Please show your support for this innocent man and put public pressure on the Georgia Parole Board to grant Troy clemency.

domain: law


text:
Get Our Award-
More Free Goodies
How to sell more music, get more people
to your shows, and make more money
in the music business.
The Artist’s Digital Presence
This free guide shows you what you need to best
market your music in the digital realm.
Eleven Tips for getting your music
Packed with practical resources and effective
methods to promote your music.
Eco-Packaging Sample Kit
This sample kit includes several Green Forestry
Practices environmental packaging options.
The Indie Artist's
Roadmap for Success
The smart way to increase sales and
build your fan base.
Learn the Business Part of Making
It In The Music Business
Oasis President Micah Solomon shares his tips,
and strategies in this exclusive FREE DVD.
“How to Have a Successful CD
Release Party ...without breaking
the bank” by David Hooper
Getting Your Music’s Worth
in the Studio
Get the ultimate thinking-musician’s guide to
doing great work in a recording environment.
How To Order
DesignWorks™ CD & DVD Design
Frankford Wayne Audio Mastering
Short-run CD Duplication by Oasis Express
Free Tools of Promotion
Design File Upload (FTP)
Content File Upload (FTP)
CD & DVD Manufacturing
Bulk CDs & DVDs
Clear Your Cover Songs
Artist & Resource Links
Guaranteed Turn Times (GTT)
Oasis Environmental Practices
CPSIA Compliance Info
CALL US TOLL FREE: 1-888-296-2747 (9AM - 5PM ET) |
© Oasis Disc Manufacturing — The trusted name in CD & DVD Manufacturing. Images and trademarks reside with their owners.

domain: entertainment


text:
Title: Virtual Q&A: Current assessment of the fixed income markets
Date: Wednesday, March 25, 2020
Time: 2:00 PM Eastern Time
Join Anne Mathias, our Global Rates and FX Strategist, for a special Q&A event. Anne will answer your questions and discuss the latest on Central Bank movements, as well as how Vanguard’s Active Fixed Income Group is positioning their portfolios.
Submit your questions when you register now or submit them during the live event.
All investing is subject to risk, including possible loss of principal.
Investment Products: Not FDIC Insured | No Bank Guarantee | May Lose Value
For financial advisors only. Not for public distribution.
© 2020 The Vanguard Group, Inc. All rights reserved.
455 Devon Park Drive | Wayne, PA 19087-1815 | advisors.vanguard.com

domain: economics