| 1. |
|
|
| 2. |
- Almhöjd, Ulrica S., et al.
(författare)
-
Analysis of carious dentine using FTIR and ToF-SIMS.
- 2014
-
Ingår i: Journal of Oral Health and Dental Management. - 1583-5588. ; 13:3, s. 735-744
-
Tidskriftsartikel (refereegranskat)abstract
- Abstract Apart from the Maillard reaction, other processes, such as esterification, take place in carious tissue. The aim of the present study was to analyse sound and carious dentine in terms of ester groups and their reaction with hydrazine derivate using Fourier Transform Infrared Spectroscopy (FTIR) and Time-of-Flight Secondary Ion Mass Spectrometry (ToF-SIMS). Carious and sound dentine from human premolars were excavated in three series (Experimental Parts I-III) and separated into inner and outer layers of carious dentine. The excavated tooth material was analysed with FTIR (Part I). Carious and sound dentine were also exposed to different chemical treatments and analysed with FTIR-Attenuated Total Reflectance (FTIR-ATR; Part II) and ToF-SIMS (Part III). The FTIR absorption spectra showed that the carious tissue contained ester groups, not detected in sound dentine. The results also indicated a higher occurrence of ester groups in the inner dental caries layer than in the outer ones. Potential binding to these ester groups by hydrazine derivative was observed after different chemical treatments with both FTIR-ATR and ToF-SIMS. The results of the present study revealed ester groups unique to the carious dentine which, after reaction with hydrazine derivative, form a covalent bond not found in sound dentine. The staining of carious unique groups would be clinically helpful in detection and prevention unnecessary removal of sound dentine.
|
|
| 3. |
- Andersson, Jens A, et al.
(författare)
-
User profiling for pre-fetching or caching in a catch-up TV network
- 2016
-
Ingår i: 2016 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB). - 9781467390446
-
Konferensbidrag (refereegranskat)abstract
- We investigate the potential of different pre-fetching and/or caching strategies for different user behaviour with respect to surfing or browsing in a catch-up-TV network. To this end we identify accounts and channels associated with strong or weak surfing or browsing respectively and study the distributions of hold times for the different types of behaviour. Finally we present results from a request prediction model and a caching simulation for the different types of behaviour and find that the results are relatively similar.
|
|
| 4. |
- Angelin, Lars, et al.
(författare)
-
A Congestion Control Algorithm for Signalling Networks Based on a State Machine Controlled by Network Delays
- 1995
-
Konferensbidrag (refereegranskat)abstract
- Congestion control in Signaling System number 7 faces new challenges as mobile com-munication systems and Intelligent Networks grow rapidly. New services change traffic patterns, add to signalling network load, and raise demands on shorter service completion times. To handle new demands, the congestion control mechanisms must foresee an over-load situation, and respond to it so that the network can maintain high throughput. With the introduction of a state machine and a memory function for each signaling link it is possible to predict the completion time of a service session and to detect an emerging congestion. If the predicted completion time of a service session is too long, the session is annihilated. This is the foundation of a congestion control mechanism that reacts fast on information supplied by the network. The congestion control mechanism enables the network to main-tain a high throughput during overload.
|
|
| 5. |
- Angelin, Lars, et al.
(författare)
-
A Congestion Control Mechanism for Signaling Networks based on Network Delays
- 1995
-
Konferensbidrag (refereegranskat)abstract
- Congestion control in Signaling System #7 faces new challenges as mo-bile communication systems and Intelligent Networks grow rapidly. New ser-vices change traffic patterns, add to signalling network load, and raise demands on shorter service completion times. To handle new demands, the congestion control mechanisms must foresee an overload situation, and respond to it so that the network can maintain high probability for successful service comple-tion. With the introduction of a state machine and a memory function for each signaling link it is possible to predict the completion time of a service session and to detect an emerging congestion. If the predicted completion time of a service session is too long, the session is annihilated. This is the foundation of a congestion control mechanism that reacts fast on information supplied by the congested part of the network. The congestion control mechanism increases the ratio of successfully completed service sessions during congestion by several hundred percent.
|
|
| 6. |
- Angelin, Lars, et al.
(författare)
-
A Network Approach to Signalling Network Congestion Control
- 1995
-
Konferensbidrag (refereegranskat)abstract
- Congestion control in Signaling System #7 faces new challenges as mobile communication systems and Intelligent Networks grow rapidly. New services change traffic patterns, add to signalling network load, and raise demands on shorter service completion times. To handle new demands, the congestion control mechanisms must foresee an overload situation, and respond to it so that the net-work can maintain high probability for successful service completion. By measur-ing the time consumption for the initial Message Signalling Units of a service session it is possible to predict the duration of the service session and to detect an emerging congestion. If the predicted duration of the service session is too long, the service session is annihilated. This is the foundation of a congestion control mechanism that reacts fast and on information supplied by the congested part of the network. The congestion control mechanism increases the ratio of successfully completed services during congestion by several hundred percent.
|
|
| 7. |
- Angelin, Lars, et al.
(författare)
-
On the Robustness of a Congestion Control Algorithm for Signaling Networks Based on a State Machine
- 1996
-
Konferensbidrag (refereegranskat)abstract
- Sessions of a signaling service with high real time demands which are subject to unaccept-able delays may be obsolete or prematurely terminated by the customer; in either way, they are a burden to the signaling network. It would ease the load of the network and im-prove the performance of all sessions in progress, if such delayed sessions could be abort-ed as quickly as possible. By measuring the network delay on individual signals of a service session, it is possible to perform signaling network congestion control that consid-ers the state in the entire signaling network. Under the assumption that a session comprises a sequence of signals between one originating node and an arbitrary number of destination nodes, it is possible to predict the total duration of a session. The prediction is calculated from previously completed signals using a state machine, which is defined per signaling link. The annihilation of sessions, for which the prediction exceeds a predefined time limit, is an embryo of a simple signaling network congestion control mechanism (CCM). This simple CCM increases the number of successfully completed services with a few hundred percent under favorable circumstances. The state machine approach has been proven to function well in all types of environments. The robustness and stability of the proposed CCM is demonstrated and the fairness in the admission of signaling services into the net-work at very high loads are also shown.
|
|
| 8. |
- Ardelius, John, et al.
(författare)
-
On the effects of caching in access aggregation networks
- 2012. - 6
-
Konferensbidrag (refereegranskat)abstract
- All forecasts of Internet traffic point at a substantial growth over the next few years. From a network operator perspective, efficient in-network caching of data is and will be a key component in trying to cope with and profit from this increasing demand. One problem, however, is to evaluate the performance of different caching policies as the number of available data items as well as the distribution networks grows very large. In this work, we develop an analytical model of an aggregation access network receiving a continuous flow of requests from external clients. We provide exact analytical solutions for cache hit rates, data availability and more. This enables us to provide guidelines and rules of thumb for operators and Information-Centric Network designers. Finally, we apply our analytical results to a real VoD trace from a network operator and show that substantial bandwidth savings can be expected when using in-network caching in a realistic setting.
|
|
| 9. |
|
|
| 10. |
|
|
