ppxscal/embedding_network huggingface dataset:
Impact of A1 incorporation in hafnia on interface states in (100)Si/HfAlxOy
Authors: Y. G. Fedorenko, V. V. Afanas'ev, A. Stesmans
Venue: Microelectronic Engineering (2005)

Interface states in (100)Si/HfAlxOy entities were studied as affected by the oxide composition and post-growth thermal treatment. Incorporation of Al in hafnia is found to reduce the total (fast and slow) trap density compared to the case of elemental Al2O3 and HfO2, though the fast interface traps are only marginally influenced. As compared to the (100)Si/SiO2 case, the excessive density of interface traps in the high-κ oxide/silicon structure is mainly caused by a significant contribution of some oxide-related defects.
Evaluating the Performance of Stochastically Triggered Bandwidth Adaptation Algorithms
Authors: Abd-Elhamid M. Taha, Hossam S. Hassanein, Hussein T. Mouftah
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The introduction of wireless multimedia applications brought about an attractive characteristic from a resource management point of view, namely the adaptability of such applications. Allocations made to deliver the multimedia applications can be varied depending on the conditions of the user, the network, or both. In a framework for resource management, the role of a bandwidth adaptation algorithm (BAA) is to provision the adaptation of the different users in A cell. Previous proposals for BAA persistently engage the adaptation whenever required. Naturally, this comes at a high system cost. In this work, the novel notion of stochastically triggered bandwidth adaptation algorithms (STBAA) is introduced. The objective of the STBAA framework is to allow system providers to exploit the tradeoff between admission ratios and user satisfaction in order to control the operational cost of adaptation1.
Connectivity Probability of Wireless Ad Hoc Networks: Definition, Evaluation, Comparison
Authors: Tatiana K. Madsen, Frank H. Fitzek, Ramjee Prasad, Gerrit Schulte
Venue: Wireless Personal Communications: An International Journal (2005)

The paper presents a new approach investigating mobile ad hoc network connectivity. It is shown how to define and evaluate the connectivity probability of a mobile network where the position of the nodes and the link quality changes over time. The connectivity probability is a measure that can capture the impact of the node movement on the network connectivity. A number of mobility models is considered ranging from the classical Random Direction model to the Virtual World model based on the mobility measurements of a multi---player game. We introduce an Attractor model as a simple way to model non---homogeneous node distribution by incorporating viscosity regions in the simulation area. Methods of ergodic theory are used to show the correctness of the approach and to reduce the computational time. Simulation results show how the node density distribution affects the network connectivity.
Uniform random number generator by shift register method
Authors: Harold Joseph Highland
Venue: ACM SIGSIM Simulation Digest (1973)

The quixotic quest for the perfect random number generator has been an overriding factor for a group of simulation purists. Although we have developed a series of tests for the evaluation of random number generators, only a few of us engaged in modeling and simulation have actually taken the time to analyze the generators we use; most are willing to accept the random number generators available on the system -- just because it is there!
MOEA design of robust digital symbol sets
Authors: Richard O. Day, Abel S. Nunez, Gary B. Lamont
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Optimal constellation design is important in military digital communications for Quadrature Amplitude Modulation (QAM). Optimization realizes a reduced probability of bit error (Pb) while keeping the same bandwidth and power for transmitting the signal. Constellation shapes currently used in QAM include rectangle, triangle, hexagonal, and concentric circles. In this study, two dimensional (4, 8,..., and 256)-ary constellations at specific normalized signal to noise ratios (Eb/No) having lower Pb are sought. Various models are designed to provide a Multi-objective Evolutionary Algorithm (MOEA) with a near exact model to utilize as a fitness function. MOEA found solutions are tested for merit using a Monte Carlo simulator. Comparisons of Eb/No vs Pb between the rectangular constellation and new designs are illustrated. New designs are shown to be different and comparable to the standard constellations used today
Hierarchical submission in a Grid environment
Authors: Patricia Kayser Vargas, Inês de Castro Dutra, Vinicius Dalto do Nascimento, Lucas A. S. Santos, Luciano C. da Silva, Cláudio F. R. Geyer, Bruno Schulze
Venue: Proceedings of the 3rd international workshop on Middleware for grid computing (2005)

One of the challenges in grid computing research is to provide means to automatically submit, manage, and monitor applications which spread a large number of tasks. The usual way of managing these tasks is to represent each one as an explicit node in a graph, and this is the approach taken by many grid systems up to date. This approach can quickly saturate the machine where the application is launched, as we increase the number of tasks. In this work we present and validate a novel architectural model, GRAND (Grid Robust ApplicatioN Deployment), whose main objective is to deal with the problem of memory and load saturation of the submission machine. GRAND is implemented at a middleware level, aiming at providing a distributed task submission through a hierarchical organization. This paper provides an overview of the GRAND submission model as well our implementation. Initial results show that our approach can be much more effective than other approaches in the literature.
Performance Evaluation of Multiagent Genetic Algorithm
Authors: J. J. Liang, S. Baskar, P. N. Suganthan, A. K. Qin
Venue: Natural Computing: an international journal (2006)

Zhong et al. (2004 [IEEE Trans. on Systems, Man and Cybernetics (Part B), 34: 1128---1141]) proposed the multiagent genetic algorithm (MAGA) in their publication titled "A multiagent genetic algorithm for global numerical optimization". The MAGA exploits the known characteristics of some benchmark functions to achieve outstanding results. For example, the MAGA exploits the fact that all variables have the same numerical value at the global optimum and the same upper and lower bounds to solve several 100 dimensional and 1000 dimensional benchmark problems with high precision requiring on average 7000 and 16,000 function evaluations respectively. In this paper, we evaluate the performance of the MAGA experimentally1 and demonstrate that the performance of the MAGA significantly deteriorates when the relative positions of the variables at the global optimal point are shifted with respect to the search ranges.
Preconditioning Strategies for Models of Incompressible Flow
Authors: H. C. Elman
Venue: Journal of Scientific Computing (2005)

We describe some new preconditioning strategies for handling the algebraic systems of equations that arise from discretization of the incompressible Navier---Stokes equations. We demonstrate how these methods adapt in a straightforward manner to decisions on implicit or explicit time discretization, explore their use on a collection of benchmark problems, and show how they relate to classical techniques such as projection methods and SIMPLE.
Software Reuse Metrics for Object-Oriented Systems
Authors: K. K. Aggarwal, Yogesh Singh, Arvinder Kaur, Ruchika Malhotra
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

The importance of software measurement increasing leading to development of new measurement techniques. Reusing existing software components is key feature in increasing software productivity. It one of the key elements in object-oriented programming, which reduces the cost and increases the quality of the software. An important feature of C++ called templates support generic programming, which allows the programmer to develop reusable software modules such as functions, classes, etc. The need for software reusability metrics is particularly acute for an organization in order to measure the degree of generic programming included in the form of templates in code. This research addresses this need and introduces a new set of metrics for object-oriented software. Two metrics are proposed for measuring amount of genericty included in the code and then analytically evaluated against Weyuker's set of nine axioms. This set of metrics is then applied to standard projects and accordingly ways in which project managers can use these metrics are suggested.
Discovering Social Networks from Event Logs
Authors: Wil M. P. Van Der Aalst, Hajo A. Reijers, Minseok Song
Venue: Computer Supported Cooperative Work (2005)

Process mining techniques allow for the discovery of knowledge based on so-called "event logs", i.e., a log recording the execution of activities in some business process. Many information systems provide such logs, e.g., most WFM, ERP, CRM, SCM, and B2B systems record transactions in a systematic way. Process mining techniques typically focus on performance and control-flow issues. However, event logs typically also log the performer, e.g., the person initiating or completing some activity. This paper focuses on mining social networks using this information. For example, it is possible to build a social network based on the hand-over of work from one performer to the next. By combining concepts from workflow management and social network analysis, it is possible to discover and analyze social networks. This paper defines metrics, presents a tool, and applies these to a real event log within the setting of a large Dutch organization.
Intrinsic band edge traps in nano-crystalline HfO2 gate dielectrics
Authors: G. Lucovsky, Y. Zhang, J. Luning, V. V. Afanase'v, A. Stesmans, S. Zollner, D. Triyoso, B. R. Rogers, J. L. Whitten
Venue: Microelectronic Engineering (2005)

Chemically pure thin films of HfO2, as well as other transition metal and rare earth elemental and complex oxides, e.g., LaScO3 and LaAlO3, are nanocrystalline as-deposited. The local bonding environments of the transition and rare earth atoms are distorted with respect to ideal octahedral or cubic bonding, and degeneracies of the respective band edge d-states are completely removed by Jahn-Teller (J-T) distortions. Spectroscopic studies have revealed these J-T term splittings, and also a band edge localized state which is assigned to an electronically-active bonding defect at nanocrystalline grain boundaries.
Co-simulation ofWireless Local Area Network Terminals with Protocol Software Implemented in SDL
Authors: Petri Kukkala, Marko Hannikainen, Timo D. Hamalainen
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This paper presents the verification of our WLAN terminal (TUTWLAN), with its medium access control protocol and test applications, using cycle-accurate hardware/ software co-simulation. The protocol software has been implemented using SDL and automatic C code generation. The hardware implementation of the terminal contains hardware accelerators for time-critical protocol functions. Full system co-simulations were used for both the functional verification and performance evaluation of a single TUTWLAN terminal as well as a network of terminals. With simulations, the performance bottlenecks were identified, and the results enable the implementing of the next generation TUTWLAN terminal as a single-chip.
Tool Support for Agent Development using the Prometheus Methodology
Authors: Lin Padgham, John Thangarajah, Michael Winikoff
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

We believe that tool support is very important for any methodology. In this paper we describe PDT (Prometheus Design Tool) which supports the design of an intelligent agent system using the Prometheus methodology. We describe how PDT supports the various stages of Prometheus through various means such as consistency checking, support for entity propagation, and hierarchical views. We will also describe work that is currently in progress which involves the development of a plug-in for Eclipse with the aim of creating a single integrated development environment which will support the complete development cycle of an agent system from design to deployment.
A Low Power 6-Bit A/D Converter Achieving 10-Bit Resolution for MEMS Sensor Interface Using Time-Interleaved Delta Modulation
Authors: Koushik De, Santiram Kal
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

This paper describes time-interleaved delta ADC as a digital interface for low frequency MEMS sensor signal. The design is presented as a simple low power solution for A/D conversion in comparison to popular sigma-delta converters. Conventional delta modulator is modified with insertion of an array of comparators and a coder i.e. an up/down counter. Time interleaving is done within the array to operate the sensitive analog part in slower speed while maintaining a higher oversampling ratio of the converter. The up/down counter acts as low-pass filter in the delta modulation loop and by resetting it in proper interval decimation can also be performed. Simulation of the test structure for the 6-bit ADC in 0.18 µm CMOS process shows output SNR of 60dB, with INL and DNLs less than 0.5 LSB. The output SNR is equivalent to 10-bit of resolution. To obtain such resolution with only 6-bit output the total power the design consumes from a single 1.8 V supply is only 2.3mW. The die area of the ADC is only 0.8mm ×0.6mm.
Strained Si and the Future Direction of CMOS, invited
Authors: Scott E. Thompson
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Uniaxial process induced strain is being adopted in all 90, 65, and 45 nm high performance logic technologies. Uniaxial strain offers large performance improvement at low cost and minimally increased manufacturing complexity and is scalable to future technology nodes.
Discrete Sibson Interpolation
Authors: Sung W. Park Lars Linsen Oliver Kreylos John D. Owens Bernd Hamann
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

Natural-neighbor interpolation methods, such as Sibson's method, are well-known schemes for multivariate data fitting and reconstruction. Despite its many desirable properties, Sibson's method is computationally expensive and difficult to implement, especially when applied to higher-dimensional data. The main reason for both problems is the method's implementation based on a Voronoi diagram of all data points. We describe a discrete approach to evaluating Sibson's interpolant on a regular grid, based solely on finding nearest neighbors and rendering and blending d{\hbox{-}}\rm dimensional spheres. Our approach does not require us to construct an explicit Voronoi diagram, is easily implemented using commodity three-dimensional graphics hardware, leads to a significant speed increase compared to traditional approaches, and generalizes easily to higher dimensions. For large scattered data sets, we achieve two-dimensional (2D) interpolation at interactive rates and 3D interpolation (3D) with computation times of a few seconds.
Method trees: building blocks for self-organizable representations of value series: how to evolve representations for classifying audio data
Authors: Ingo Mierswa, Katharina Morik
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

In this paper we introduce a framework for automatic feature extraction from very large series. The extracted features build a new representation which is better suitable for a given learning task. The development of appropriate feature extraction methods is a tedious effort, particularly because every new classification task requires tailoring the feature set anew. Therefore, the simple building blocks defined in our framework can be combined to complex feature extraction methods. We employ a genetic programming approach guided by the performance of the learning classifier using the new representation. Our approach to evolve representations from series data requires a balance between the completeness of the methods on one side and the tractability of searching for appropriate methods on the other side. In this paper, some theoretical considerations illustrate the trade-off. After the feature extraction, a second process learns a classifier from the transformed data. The practical use of the methods is shown by two types of experiments in the domain of music data classification: classification of genres and classification according to user preferences.
SIOX: Simple Interactive Object Extraction in Still Images
Authors: Gerald Friedland, Kristian Jantz, Raul Rojas
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

The following article presents an approach for interactive foreground extraction in still images that is currently being integrated into the GIMP. The presented approach has been derived from color signatures, a technique originating from image retrieval. The article explains the algorithm and presents some benchmark results to show the improvements in speed and accuracy compared to state-of-the-art solutions. The article also describes how the algorithm can easily be adapted for video segmentation tasks.
A slot swapping protocol for time-critical internetworking
Authors: L. Lo Bello, A. Gangemi
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

This paper proposes an architecture and communication protocol called the Slot Swapping Protocol which is used to interconnect, by means of a backbone, different subsystems that generate and consume real-time data. The proposed communication architecture fits well into the general Computer Integrated Manufacturing (CIM) model, thus representing an appealing solution for FieldBus interconnection in factory automation systems.Inspired by the concept of session swapping, the Slot Swapping Protocol makes a step forward in slotted rings by including explicit time constraints in traffic scheduling, as it assigns a dynamic priority to slots and uses an Earliest Deadline First-based swapping policy. The paper describes the communication protocol, discusses three slot swapping approaches and presents a set of experiments characterizing the protocol's ability to meet traffic deadlines in several working conditions.
A key pre-distribution scheme for secure sensor networks using probability density function of node deployment
Authors: Takashi Ito, Hidenori Ohta, Nori Matsuda, Takeshi Yoneda
Venue: Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks (2005)

Pairwise key establishment is a fundamental service provided in secure sensor networks. However, due to resource constraints, establishing pairwise keys is not a trivial task. Recently, a random key pre-distribution scheme and its improvements have been proposed. The scheme proposed by Du et al. uses deployment knowledge to improve the performance and security of sensor networks. However, this scheme assumes group-based deployment in which groups of nodes are deployed from horizontal grid points. This assumption limits applications of the scheme. Therefore, in this paper, we propose an advanced key pre-distribution scheme in which different keys are logically mapped to two-dimensional positions, and the keys that are distributed to a node are determined by positions estimated using a node probability density function. The scheme can be applied to any deployment model provided the node probability density function has already been determined. Furthermore, simulation results show that our scheme achieves higher connectivity than Du et al.'s scheme.
A Scalable Method for Predicting Network Performance in Heterogeneous Clusters
Authors: Dimitrios Katramatos, Steve J. Chapin
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

An important requirement for the effective scheduling of parallel applications on large heterogeneous clusters is a current view of system resource availability. Maintaining such a view is a time consuming problem, potentially O(N^2). Although CPU availability is relatively easy to monitor, interconnecting network bandwidth varies not only with network topology, but also with message size and even with respect to the load of the communicating nodes. This paper describes a method for predicting a cluster's network performance for the purpose of scheduling parallel applications. The method generates a cluster-specific network model which can predict the latency of communications between any pair of nodes in linear time and under any computational and/or communication load conditions. The paper also presents the models generated for the Centurion cluster at the University of Virginia and the Orange Grove cluster at Syracuse University. A study of the prediction accuracy of the method under various load conditions by comparison to experimental measurements indicates an average prediction error of approximately 5% with the maximum encountered prediction error of less than 9%.
QoS-Energy aware Broadcast for Sensor Networks
Authors: Arjan Durresi, Vamsi Paruchuri, Leonard Barolli
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

We present QoS Geometric Broadcast Protocol (QoSGBP), a novel broadcasting protocol for heterogeneous wireless ad hoc and sensor networks. While broadcasting is a very energy-expensive protocol, it is also widely used as a building block for a variety of other network layer protocols. Therefore, reducing the energy consumption by optimizing broadcasting is a major improvement in heterogenous sensor networking. QoS-GBP is a distributed algorithm where nodes make local decisions on whether to transmit based on a geometric approach. QoS-GBP enables a tradeoff among the need for neighborhood information (communication overhead) and the delay. QoS-GBP is scalable to the change in network size, node type, node density and topology. QoS-GBP accommodates seamlessly such network changes, including the presence of actors and mobile nodes in heterogeneous sensor networks. Through simulation evaluations, we show that QoS-GBP is very scalable and guarantees minimum delay.
An evaluation of the close-to-files processor and data co-allocation policy in multiclusters
Authors: H. H. Mohamed, D. H. J. Epema
Venue: Proceedings of the 2004 IEEE International Conference on Cluster Computing (2004)

In multicluster systems, and more generally, in grids, jobs may require coallocation, i.e., the simultaneous allocation of resources such as processors and input files in multiple clusters. While such jobs may have reduced runtimes because they have access to more resources, waiting for processors in multiple clusters and for the input files to become available in the right locations may introduce inefficiencies. In previous work, we have studied through simulations only processor coallocation. Here, we extend this work with an analysis of the performance in a real testbed of our prototype processor and data coallocator with the close-to-files (CF) job-placement algorithm. CF tries to place job components on clusters with enough idle processors which are close to the sites where the input files reside. We present a comparison of the performance of CF and the worst-fit job-placement algorithm, with and without file replication, achieved with our prototype. Our most important findings are that CF with replication works best, and that the utilization in our testbed can be driven to about 80%.