ppxscal/embedding_network huggingface dataset:
Towards Uniform Temperature Distribution in SOI Circuits Using Carbon Nanotube Based Thermal Interconnect
Authors: Yu Zhou, Somnath Paul, Swarup Bhunia
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Increasing power density (due to faster clock and high device integration density) coupled with limited cooling capacity of the package causes die overheating and leads to reliability concerns. In this paper, we present a methodology to mitigate temperature-induced reliability problems by transferring the heat dissipated in a region of high activity (such as the ALU in a processor that creates localized “hotspot”) to regions of lower activity (such as on-chip cache). We propose to use carbon nanotubes (CNTs) as “thermal interconnect” for on-die heat transfer since CNTs have significantly higher thermal conductivity than typical heat-spreader materials. We note that the proposed heat transfer framework is particularly suitable to thermal management in Silicon-on-Insulator (SOI) devices, which suffer from fine-grained thermal gradient. Simulation results indicate that the use of CNTs for heat conduction from hotspot to a region of lower activity (which we denote as a ‘coolspot’), achieves 13% (16°C) decrease in temperature at the hotspot and only 3% (1.5°C) increase in temperature at the coolspot of an alpha microprocessor model.
Characterizing, Modeling and Predicting Dynamic Resource Availability in a Large Scale Multi-purpose Grid
Authors: Farrukh Nadeem, Radu Prodan, Thomas Fahringer
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

The functional heterogeneity of computational Grids has highly increased due to inclusion of resources other than dedicated to Grid, like from non-dedicated desktop Grids,on-demand systems and even from P2P systems and mobile Grids. At such a diversified scale, resources exhibit different availability properties mainly due to administrators' policies for resource availability in the Grid, and their failure/unavailability properties. These make resources' availability predictions for optimized resource selection, a challenging problem. Addressing this problem, we characterize resource availability properties against their availability policies to understand their availability behavior and quantify it through availability models. We further exploit the availability/failure properties to make predictions about their availability through pattern recognition and classification. We have achieved, on average, accuracy of more than 90% and 75% in our predictions for resource instance availability and lifetime respectively.
Actor-Based Simulation of PDEVS systems over HLA
Authors: F. Cicirelli, A. Furfaro, L. Nigro
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

The work described in this paper aims at experimenting with PDEVS modelling and simulation of complex and variable structure systems. The approach is centred on the use of actors (agents), i.e. lightweight reactive objects which communicate to one another by asynchronous message-passing. Actors can migrate from a computing node to another. More specifically, this paper proposes a mapping of Actor DEVS, a lean control-based framework supporting PDEVS in Java, over HLA using an adaptation of the Theatre actor-based software architecture, which provides location-transparent naming and efficient network communications. The combination Actor DEVS/Theatre makes it possible to customize the PDEVS simulation control engine. The paper shows a parallel simulation engine with a time management compliant with HLA, which embodies a tie-breaking mechanism for simultaneous events. The practical use of the resultant approach is demonstrated through an example.
A framework for automatic time-domain characteristic parameters extraction of human pulse signals
Authors: Pei-Yong Zhang, Hui-Yan Wang
Venue: EURASIP Journal on Advances in Signal Processing (2008)

A methodology for the automated time-domain characteristic parameter extraction of human pulse signals is presented. Due to the subjectivity and fuzziness of pulse diagnosis, the quantitative methods are needed. Up to now, the characteristic parameters are mostly obtained by labeling manually and reading directly from the pulse signal, which is an obstacle to realize the automated pulse recognition. To extract the parameters of pulse signals automatically, the idea is to start with the detection of characteristic points of pulse signals based on wavelet transform, and then determine the number of pulse waves based on chain code to label the characteristics. The time-domain parameters, which are endowed with important physiological significance by specialists of traditional Chinese medicine (TCM), are computed based on the labeling result. The proposed methodology is testified by applying it to compute the parameters of five hundred pulse signal samples collected from clinic. The results are mostly in accord with the expertise, which indicate that the method we proposed is feasible and effective, and can extract the features of pulse signals accurately, which can be expected to facilitate the modernization of pulse diagnosis.
Dynamic modeling of groundwater pollutants with bayesian networks
Authors: Khalil Shihab, Haider Ramadhan, Nida Al-Chalabi
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

We describe the development and application of a prototype Dynamic Bayesian Network (DBN) that models groundwater quality efficiently. First, we present a new technique for data preprocessing that is needed when groundwater databases are used as the data source to learn the probabilities for dynamic decision models. Then we describe the network models we developed, as well as the methods we are used. Various challenges, such as acquiring groundwater datasets and identifying pollutants and anticipating potential problem contaminants, are addressed. Finally, we present the results of applications of these models.
A Secure Group Key Management Scheme for Sensor Networks
Authors: A. S. Poornima, B. B. Amberker
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Security is an important issue in sensor networks. Many applications in military, distributed information gathering etc., demand for Secure Group Communication (SGC) in sensor networks. The SGC requires common network-wide group key for confidentiality of control messages and data reports. The group key should be updated when a node is compromised. In this paper we propose a new key management scheme for group key computation and distribution which is based on tree structure. The proposed scheme minimizes storage as well as communication and computation cost of end user (i.e., sensor nodes). The complex encryption/decryption operations used to distribute new group key whenever a node is compromised are replaced by one way hash functions and simple XOR operations.
Scalable adaptive web services
Authors: Marin Litoiu, Mircea Mihaescu, Dan Ionescu, Bogdan Solomon
Venue: Proceedings of the 2nd international workshop on Systems development in SOA environments (2008)

Software as a service creates the possibility of composing software applications from web services spread across different application domains. To guarantee certain quality of services of the composite service, one can think of two paths ahead: quality of service negotiation and guarantee prior to service deployment and bindings; or a more speculative and adaptive behavior at runtime. In this position paper we propose a hybrid approach, combining development and runtime information to make the web services adapt to workload variations. The approach combines control theory with performance modeling and is built around a model of the web service. A control loop theory approach is taken to model discovery. The control loop allows for keeping the web service's performance even when the model is not completely known and failure of components of the control loop are likely to happen. The approach is related to robust state estimation. The robustness makes the model insensitive to parameter variations and to uncertainties in the model. With appropriate conditions, the above concept can be extended to the external environments in which the web service has to perform.
Error analysis for bivariate fractal interpolation functions generated by 3-D perturbed iterated function systems
Authors: Hong-Yong Wang, Shou-Zhi Yang, Xiu-Juan Li
Venue: Computers Mathematics with Applications (2008)

Based on a determined 3-D iterated function system (IFS), we introduce a perturbed IFS in R^3. The attractor of the perturbed IFS is the graph of a bivariate fractal interpolation function (FIF) that interpolates arbitrarily given data on rectangular grids of R^2. We consider the error problem between the FIF generated by the perturbed IFS and the FIF generated by the original IFS. An explicit relation of the difference between the two bivariate FIFs is presented. Furthermore, we investigate the error of moment integrals of the two FIFs. An upper bound estimate for the error of moments is obtained.
Proof search in H&aacute;jek's basic logic
Authors: Simone Bova, Franco Montagna
Venue: ACM Transactions on Computational Logic (TOCL) (2008)

We introduce a proof system for H&aacute;jek's logic BL based on a relational hypersequents framework. We prove that the rules of our logical calculus, called RHBL, are sound and invertible with respect to any valuation of BL into a suitable algebra, called (&omega;)&lsqb;0,1&rsqb;. Refining the notion of reduction tree that arises naturally from RHBL, we obtain a decision algorithm for BL provability whose running time upper bound is 2O(n), where n is the number of connectives of the input formula. Moreover, if a formula is unprovable, we exploit the constructiveness of a polynomial time algorithm for leaves validity for providing a procedure to build countermodels in (&omega;)&lsqb;0, 1&rsqb;. Finally, since the size of the reduction tree branches is O(n3), we can describe a polynomial time verification algorithm for BL unprovability.
A Verification-Based Localization Method for Unstable Radio Sensor Networks in Smart Home Environments
Authors: Yong-Ming Huang, Ding-Chao Wang, Chao-Chun Chen
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

One of the key technologies of the ubiquitous sensor networks is localization. Most localization techniques nowadays apply ranging techniques to compute the location of the object wireless sensor network. Although the RSSI-based ranging technology is widely used and a cost-effective solution for localization in wireless sensor networks, a wireless ad hoc network is a fading signal environment that comprises noises. The noises cause RSSI to be unstable and lead to abrupt distance estimates. In this paper, we propose a Verification-Based Localization Method (VBLM) that determines whether a received signal is a noise. Our basic idea is that the unknown node uses another neighboring beacon to assist to verify the quality of received signal. The experimental results show that VBLM indeed reduces the localization error in the unstable radio sensor networks.
Neville-Lagrange wavelet family for lossless image compression
Authors: Dong Chen, Tianwen Zhang
Venue: Signal Processing (2008)

This paper presents a new wavelet family by combining the Neville filter theory and Lagrange interpolation. The filter banks of the new wavelet family are built and named as Neville-Lagrange lifting wavelet filter banks (N-LLWFBs for short). The prediction filters of N-LLWFBs are obtained by considering the signal sampling and Lagrange interpolation, and the corresponding update filters are given by using Neville filter theory. Examples are given by using this approach. The Neville-Lagrange prediction filters are obtained; causal lifting wavelet filter banks are also constructed by using this approach. Several N-LLWFBs for image compression are designed, and they are normalized in terms of the normalization conditions of the first generation wavelet filter bank. As a special example, the lifting scheme of 5/3 wavelet of JPEG2000 is obtained; it is the two-channel N-LLWFB of order 2 both dual and primal vanishing moments. Experiment results show that the performance of N-LLWFBs for image compression becomes better with the increase of their vanishing moments.
Asynchronous Collaborative Virtual Environment Support System by Using Revision Tree Presentation Method
Authors: Hiroki Ogasawara, Yoshitaka Shibata
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, we introduce a new idea of Revision Tree which can provide a flexible mechanism to store the current collaborative virtual environments (CVE) space, replay the past recorded CVE space and replace the current CVE by other past CVE space. Revision Tree with hierarchical 3D structure is visualized in space and operated by users to refer thepast space information using replay, revert, clone and merge functions. Those functions provide effective and flexible collaborative work in CVE to support communication among many users over computer network. Using this method, the users as group members can progress collaborative work and confirm the past CVE without prior communication even ifsome of the group members do not participate in the space. Thus, asynchronous collaborative work can be attained and applied to efficiently more creative CVE applications.
Comparison of Two Forward Error Correction Approaches for Packet Protection in HDTV with Variable Bit Rate Transmission
Authors: Frederik Vanhaverbeke, Marc Moeneclaey, Koen Laevens, Natalie Degrande, Danny De Vleeschauwer
Venue: Proceedings of the Seventh International Conference on Networking (2008)

We examine the efficiency of two FEC strategies for the protection of HDTV video packets transmitted at variable bit rate. The first FEC strategy pursues packet protection by means of a fixed Reed-Solomon code. The second strategy encodes a set of packets within a fixed time frame resulting in Reed-Solomon codes of variable length. We quantify the performance of both strategies for a representative movie where the HDTV video packets are transmitted at variable bit rate over a channel that is subjected to independent errors and error bursts.
Robust range-free localization in wireless sensor networks
Authors: Kui Wu, Chong Liu, Jianping Pan, Dandan Huang
Venue: Mobile Networks and Applications (2007)

In wireless sensor networks, sensors should have some mechanisms to learn their locations since sensed data without associated location information may be meaningless. While many sensor localization algorithms have been proposed, security issues in sensor localization are usually not addressed in their original design. Secure sensor localization is very challenging due to limited computation and energy resources in sensors. It is highly desirable that a localization scheme is robust and is able to detect malicious attacks without using complex cryptographic operations. In this paper, we present and analyze detection methods purely based on geometric constraints in sensor networks. Our detection methods can protect the localization algorithm from malicious attacks by detecting and eliminating the negative impact of fake information.
Towards Integrated Model-Driven Testing of SCADA Systems Using the Eclipse Modeling Framework and Modelica
Authors: Jörn Guy Süβ, Adrian Pop, Peter Fritzson, Luke Wildman
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Testing SCADA (Supervisory Control And Data Acquisition) near real-time systems is challenging, as it involves complex interactions and the simulation of the supervised and controlled environment. Model-driven testing techniques can help to achieve clarity about the inner workings of the system and facilitate test construction, but these models are currently disconnected from those of the environmental simulation, leading to a paradigm break. This paper presents a strategy to remedy this situation. To this end, it leverages Modelica and the Eclipse Modeling Framework.Modelica is an object-oriented mathematical modeling language for component-oriented modeling of complex physical systems. It is an open standard and implementation, and provides a rendering of its input language in Ecore, the meta-language of the Eclipse Model-ing Framework (EMF). It also offers convenient visual editors, whose notation via the ModelicaML profile is consistent with the SysML standard, a restricted version of UMLThe strategy presented here leverages EMF as a common basis for model-driven development, reusing Modelica’s powerful simulation features in integration with a custom-designed testing process. With this tool-ing, a test engineer can model all aspects of a SCADA test within one workbench and enjoy full traceability between the proprietary test model, and its surrounding environment simulation.
Linguistic symbiosis between actors and threads
Authors: Tom Van Cutsem, Stijn Mostinckx, Wolfgang De Meuter
Venue: Proceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 2007 (2007)

We describe a linguistic symbiosis between AmbientTalk, a flexible, domain-specific language for writing distributed programs and Java, a conventional object-oriented language. This symbiosis allows concerns related to distribution (service discovery, asynchronous communication, failure handling) to be handled in the domain-specific language, while still enabling the reuse of existing software components written in a conventional language. The symbiosis is novel in the sense that a mapping is defined between the concurrency models of both languages. AmbientTalk employs an inherently event-driven model based on actors, while conventional object-oriented languages employ a concurrency model based on threads. The contribution of this paper is a linguistic symbiosis which ensures that the invariants of the event-driven concurrency model are not violated by engaging in symbiosis with multi-threaded programs.
Long-run underperformance of seasoned equity offerings: Fact or an illusion?
Authors: D. E. Allen, V. Soucik
Venue: Mathematics and Computers in Simulation (2008)

This paper uses Australian data from 1984 to 1993 to show that the long-run underperformance of seasoned equity offerings is related to the definition of 'long-run'. We demonstrate that following the period delimited by other writers as the long-run, issuing firms turn around in their performance and in fact outperform their corresponding benchmarks, sometimes more than making up for the initial losses. We show that the initial underperformance affects the issues of companies performing more than one seasoned equity offering (SEO) in a similar fashion. Our results, the first to examine Australian long-run SEO performance, show that underperformance of Australian seasoned equity issues is dependent on the definition of the 'long-run'. (Allen and Patrick [D.E. Allen, M. Patrick, Some further Australian evidence on the long-run performance of initial public offerings: 1974-1984, Pac. Basin Financ. Markets 2A (1996) 133-155. [1]] examined long-run IPO performance.) When long-run is defined as 12 years instead of the usual 5 years, SEOs can be clearly seen to turn around their performance particularly during years six and seven. A series of regression results point to a number of factors that bear influence on the extent of the initial underperformance. Decreased ex-ante uncertainty associated with older firms causes a negative relationship between the age and the extent of underpricing. Moreover, the greater is the SEO cost specifically associated with underpricing of the new equity, the greater is the underperformance that follows the issue.
List's worst-average-case or WAC ratio
Authors: Christopher J. Osborn, Eric Torng
Venue: Journal of Scheduling (2008)

We analyze the List scheduling algorithm for the problem of minimizing makespan using a worst-average-case or wac analysis technique, previously used by Kenyon for analyzing the Best Fit bin packing algorithm. We show that List's worst-average-case or wac ratio asymptotically approaches 2, as m->∞. Thus, List's worst-case behavior is not overly dependent on the order of job arrivals.
Nanostructured oxides on porous silicon microhotplates for NH3 sensing
Authors: R. Triantafyllopoulou, X. Illa, O. Casals, S. Chatzandroulis, C. Tsamis, A. Romano-Rodriguez, J. R. Morante
Venue: Microelectronic Engineering (2008)

Low power micromachined gas sensors based on suspended micro-hotplates are presented in this work. The sensors were fabricated using Porous Silicon Technology. Two different metal-modified nanostructured sensitive materials were deposited on top of the active area of the micro-hotplates, using the micro-dropping technique: SnO"2:Pd and WO"3:Cr. For the characterization of both gas sensors, measurements in NH"3 ambient took place, in isothermal mode of operation. Improved sensors characteristics were obtained for SnO"2:Pd sensors, compared to WO"3:Cr, for these operating conditions.
An Autonomic Context Management System for Pervasive Computing
Authors: Peizhao Hu, Jadwiga Indulska, Ricky Robinson
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Context-aware applications adapt to changingcomputing environments or changing user circumstances/tasks. Context information that supports suchadaptations is provided by the underlying infrastructure,which gathers, pre-processes and provisions context informationfrom a variety of context information sources. Suchan infrastructure is prone to failures and disconnectionsthat negatively impact on the ability of context-awareapplications to adapt (and therefore dramatically impacton their usability). This paper describes a model-basedautonomic context management system (ACoMS) that candynamically configure and reconfigure its context informationgathering and pre-processing functionality in order toprovide fault tolerant provisioning of context information.The approach uses standards based descriptions of contextinformation sources to increase openness, interoperabilityand scalability of context-aware systems.