ppxscal/embedding_network huggingface dataset:
Fair Integrated Scheduling of Soft Real-time Tardiness Classes on Multiprocessors
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Prior work on Pfair scheduling has resulted in three optimalmultiprocessor scheduling algorithms, and one algorithm,EPDF, that is less expensive but not optimal. EPDF isstill of interest in soft real-time systems, however, due to itsability to guarantee bounded tardiness. In particular, it hasbeen shown that a tardiness bound of t quanta is possible underEPDF if all task weights (i.e., shares or utilizations) arerestricted to a value specified as a function of t. In an actualsystem, however, different tasks may be subject to differenttardiness bounds. If such a system is scheduled under EPDF,then the tardiness of a task with a higher bound may causethe tardiness bound of a task with a lower bound to be violated;that is, temporal isolation among the various tardinessclasses may not be guaranteed. In this paper, we propose analgortihm based on EPDF for scheduling task classes withdifferent tardiness bounds on a multiprocessor. Our algorithmprovides temporal isolation among classes, allows theavailable processing capacity to be fully utilized, and doesnot require that previously established per-task weight restrictionsbe made more stringent.
Noise Analysis for Optical Fiber Communication Systems
Authors: Alper Demir
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

The optical fiber transmission links form the backbone of the communicationsinfrastructure. Almost all of voice and data (internet) traffic is routed throughterrestrial and submarine optical fiber links, connecting the world together. Invention of the optical amplifiers (OAs) and wavelength-division multiplexing(WDM) technology enabled very high capacity optical fiber communicationlinks that run for thousands of kilometers without any electronic repeaters, butat the same time brought many design challenges. As electronic amplifiers do,OAs add noise to the signal they amplify. In the design of an optical fibercommunication link, the prediction of the deterioration the information signalsexperience due to the nonlinearity of the optical fiber and the optical noise generated by the OAs is essential. In this paper, we first present a short overviewof optical fiber communication systems and the challenges that faces one froma modeling, analysis and design perspective. Then, we describe novel formulations and computational techniques for the analysis of the interplay between theinformation signals and the optical noise due to the fiber nonlinearity as theypropagate together along the fiber link. Our formulations are similar, in spirit,to the linear(ized), time-varying formulations for noise analysis in analog/RFelectronic circuits. We then investigate signal-noise mixing due to optical fibernonlinearities using the techniques developed. Finally, we discuss the use ofthe generated results in the performance evaluation of communication links,and comment on system design implications.
Blood Vessels Segmentation in Retina via Wavelet Transforms Using Steerable Filters
Authors: Zhu Hongqing, Shu Huazhong, Luo Limin
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This paper presents an efficient method for automatic segmentation of blood vesselsin retinal images. A set of directional basis filters based on dyadic wavelet transform isdesigned to enhance blood vessels. It attempts to utilize the linear combination of thewavelet transforms to fix on the blood vessels directional information in retinal images.The directional maps are processed by thresholding scheme in order to segment bloodvessels from the background. The proposed thresholding approach evaluates 2-Dentropies based on the gray level-gradient co-occurrence matrix. The 2-D thresholdingvector that maximizes the edge class entropies is selected. The thresholding methodutilizes the gray level and gradient information in the enhanced image. The new methodpromises the simpleness and flexibility in many image enhancement and segmentationapplications.
Packet-mode policies for input-queued switches
Authors: Dan Guez, Alex Kesselman, Adi Rosén
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

This paper considers the problem of packet-mode scheduling of input queued switches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives to the switch with a given deadline by which it must traverse the switch. A packet successfully passes the switch if the sequence of cells comprising it is contiguously transmitted out of the switch before the packet's deadline expires. A packet transmission may be preempted and restarted from the beginning later. The scheduling policy has to decide at each time step which packets to serve. The problem is online in nature, and thus we use competitive analysis to measure the performance of our scheduling policies.First we consider the case where the goal of the switch policy is to maximize the total number of successfully transmitted packets. We derive two algorithms achieving the competitive ratios of (22√log L +1) and N+ 1, respectively, where L is the ratio between the longest and the shortest packet lengths and N is the number of input/output ports. We also show that any deterministic online algorithm has a competitive ratio of at least (⌊log L⌋ + 1, N).Then we study the general case in which each packet has an intrinsic value representing its priority, and the goal is to maximize the total value of successfully transmitted packets. We derive an algorithm which achieves a competitive ratio of 2κ+2√κ+1/2+ (2κ+√κ+1/2+1) (√κ+1/2+3), where κ is the ratio between the maximum and the minimum value per cell. We note that [4] gives a lower bound of Ω(κ) on the performance of any deterministic online algorithm. In particular, our algorithm achieves a competitive ratio of approximately 11.123 for κ=1, which improves upon the previous best-known upper bound for this problem [17].We complement our results by studying the offline version of the problem, which is NP-hard We give a pseudo-polynomial 3-approximation algorithm for the general case and a polynomial 3-approximation algorithm for the case of unit value packets.
L(h,1)-labeling subclasses of planar graphs
Authors: Tiziana Calamoneri, Rossella Petreschi
Venue: Journal of Parallel and Distributed Computing (2004)

L(h, 1)-labeling, h = 0, 1, 2, is a class of coloring problems arising from frequency assignment in radio networks, in which adjacent nodes must receive colors that are at least h apart while nodes connected by a two long path must receive different colors. This problem is NP-complete even when limited to planar graphs. Here, we focus on L(h, 1)-labeling restricted to regular tilings of the plane and to outerplanar graphs. We give a unique parametric algorithm labeling each regular tiling of the plane. For these networks, a channel can be assigned to any node in constant time, provided that relative positions of the node in the network is locally known. Regarding outerplanar graphs with maximum degree Δ, we improve the best known upper bounds from Δ + 9, Δ + 5 and Δ + 3 to Δ + 3, Δ + 1 and Δ colors for the values of h equal to 2, 1 and 0, respectively, for sufficiently large values of Δ. For h = 0, 1 this result proves the polinomiality of the problem for outerplanar graphs. Finally, we study the special case Δ = 3, achieving surprising results.
Analysis of a Free Roaming Agent Result-Truncation Defense Scheme
Authors: Jianying Zhou, Jose A. Onieva, Javier Lopez
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Mobile agents play an important role in electronic commerce. Security in free-roaming agents is especially hard to achieve when the mobile code is executed in hosts that may behave maliciously. Some schemes have been proposed to protect agent data (or computation results). However, a known vulnerability of these techniques is the truncation attack where two visited hosts (or one revisited host) can collude to discard the partial results collected between their respective visits. Cheng and Wei proposed a scheme in ICICSý02 to defense against the truncation of computation results of free-roaming agents [1]. Cheng-Wei scheme is effective against such an attack in most cases. However, we demonstrate that it still suffers from the truncation attack when a special loop is established on the path of a free-roaming agent. We further propose two amendments to Cheng-Wei scheme to avoid such an attack.
Empirical Analysis of Computational and Accuracy Tradeoffs Using Compactly Supported Radial Basis Functions for Surface Reconstruction
Venue: Proceedings of the Shape Modeling International 2004 (2004)

Implicit surfaces can be constructed from scattered surfacepoints using radial basis functions (RBFs) to interpolatethe surfaceýs embedding function. Many researchershave used thin-plate spline RBFs for this because of theirdesirable smoothness properties. Others have used compactlysupported RBFs, leading to a sparse matrix solutionwith lower computational complexity and better conditioning.However, the limited radius of support introduces a freeparameter that leads to varying solutions as well as varyingcomputational requirements: a larger radius of supportleads to smoother and more accurate solutions but requiresmore computation. This paper presents an empirical analysisof this radius of support. The results using compactlysupported RBFs are compared for varying model sizes andradii of support, exploring the relationship between datadensity and the accuracy of the interpolated surface.
Comments on "Dynamic wavelength routing using congestion and neighborhood information"
Authors: Yongtao Gong, Peiyuan Lee, Wanyi Gu
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

In this Comments, two typos in Li and Somani's paper are pointed out. These errors may puzzle readers or even prevent them from drawing the right conclusion. In the second part of this Comments, the authors propose a correction to these errors.
Map morphing: making sense of incongruent maps
Authors: Derek F. Reilly, Kori M. Inkpen
Venue: Proceedings of Graphics Interface 2004 (2004)

Map morphing is an interactive visualization technique that provides a user-controlled, animated translation from one map to another. Traditionally, overlay mechanisms are used to present layers of information over a single projection. Map morphing provides a way to relate maps with significant spatial and schematic differences. This paper presents the morphing technique and the results of a comparative evaluation of map morphing against standard ways of presenting related maps. Our results demonstrate that map morphing provides additional information that can be used to effectively relate maps. In particular, significantly more tasks were completed correctly using the morphing interface than either a windowed or an inset interface.
Automatic Building of Executable Models from Abstract SoC Architectures Made of Heterogeneous Subsystems
Authors: Adriano Sarmento, Wander Cesario, Ahmed Amine Jerraya
Venue: Proceedings of the 15th IEEE International Workshop on Rapid System Prototyping (2004)

Designing SoCs requires several refinement stepsusing abstract architectural models before achieving acorrect implementation of the system described at RTlevel.Before and after each refinement step, the SoCmodel must be validated. If the model is executablethen validation can be easily done by simulation. However,since modern SoCs are composed of heterogeneoussubsystems, executable models for such heterogeneoussystems require co-simulation interfaces to enablecommunication among the different subsystems.Most current validation approaches give little supportfor building executable models for heterogeneous systems.This paper presents an approach for automaticbuilding executable models from abstract SoC architectures,allowing validation at early stages, at severalintermediate design steps and with heterogeneous subsystems.Results for the validation of a MPEG-4 videoencoder application showed that the time for buildingexecutable models was reduced drastically.
Charge trapping and detrapping in HfO2 high-k gate stacks
Authors: E. P. Gusev, C. D'Emic, S. Zafar, A. Kumar
Venue: Microelectronic Engineering (2004)

We report on charge transfer (trapping and detrapping) dynamics in ultrathin poly-Si gated NFET devices with ultrathin HfO2 high-k gate dielectrics deposited by atomic layer deposition (ALD). The focus of this work is twofold: (i) to investigate the role of processing on charge trapping in the ALD HfO2 stacks and (ii) to study trapped charge (in)stability (i.e., detrapping) as a function of temperature, gate bias and light illumination. The kinetics of both trapping and detrapping suggest the existence of more than one kind of existing traps with their energy levels located deep in the forbidden gap of the insulator.
Algebraic implementation of abstract data types: an announcement
Authors: H. Ehrig, H. J. Kreowski, P. Padawitz
Venue: ACM SIGACT News (1979)

A new concept for the implementation of abstract data types is proposed: Given algebraic specifications SPECO and SPEC1 of abstract data types ADTO and ADT1 an implementation of ADTO by ADT1 is defined separately on the syntactical level of specifications and on the semantical level of algebras. In addition to a short overview a simple example is provided.
Haptics-Based Dynamic Implicit Solid Modeling
Authors: Jing Hua, Hong Qin
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

This paper systematically presents a novel, interactive solid modeling framework, Haptics-based Dynamic Implicit Solid Modeling, which is founded upon volumetric implicit functions and powerful physics-based modeling. In particular, we augment our modeling framework with a haptic mechanism in order to take advantage of additional realism associated with a 3D haptic interface. Our dynamic implicit solids are semi-algebraic sets of volumetric implicit functions and are governed by the principles of dynamics, hence responding to sculpting forces in a natural and predictable manner. In order to directly manipulate existing volumetric data sets as well as point clouds, we develop a hierarchical fitting algorithm to reconstruct and represent discrete data sets using our continuous implicit functions, which permit users to further design and edit those existing 3D models in real-time using a large variety of haptic and geometric toolkits, and visualize their interactive deformation at arbitrary resolution. The additional geometric and physical constraints afford more sophisticated control of the dynamic implicit solids. The versatility of our dynamic implicit modeling enables the user to easily modify both the geometry and the topology of modeled objects, while the inherent physical properties can offer an intuitive haptic interface for direct manipulation with force feedback.
Block-based Static Timing Analysis with Uncertainty
Authors: Anirudh Devgan, Chandramouli Kashyap
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Static timing analysis is a critical step in design of any digitalintegrated circuit. Technology and design trends have ledto significant increase in environmental and process variationswhich need to be incorporated in static timing analysis.This paper presents a new, efficient and accurate block-basedstatic timing analysis technique considering uncertainty.This new method is more efficient as its modelsarrival times as cumulative density functions (CDFs) anddelays as probability functions (PDFs). Computationallysimple expression are presented for basic static timing operations.The techniques are valid for any form of the probabilitydistribution, though the use piecewise linear modelingof CDFs is highlighted in this paper. Reconvergent fanoutsare handled using a new technique that avoids path tracing.Variable accuracy timing analysis can be performed byvarying the modeling accuracy of the piecewise linearmodel. Regular and statistical timing on different parts ofthe circuit can be incorporated into a single timing analysisrun. Accuracy and efficiency of the proposed method is demonstratedfor various ISCAS benchmark circuits.
Anonymous credentials with biometrically-enforced non-transferability
Authors: Russell Impagliazzo, Sara Miner More
Venue: Proceedings of the 2003 ACM workshop on Privacy in the electronic society (2003)

We present a model and protocol for anonymous credentials. Rather than using deterrents to ensure non-transferability, our model uses secure hardware with biometric authentication capabilities.Using the model combining biometric authentication with anonymous credentials in the wallet-with-observer architecture proposed by Bleumer [4], we formalize the requirements of an anonymous credential protocol. In doing so, we define what it means for a protocol to be strongly subliminal-free, and show that any protocol meeting this new definition can be used in a non-transferable anonymous credential system. Our new definition improves upon subliminal-freeness as used by Burmester et al [10], in that we restrict information flow among parties even when one party detects that others in the protocol are dishonest.We describe a new protocol which is strongly subliminal-free. We then extend this basic model in a modular way to include the additional feature that the issuing authority may revoke credentials via a single (broadcast) message. Finally, we present a second protocol in the extended model.
A new family of Cayley expanders (?)
Authors: Eyal Rozenman, Aner Shalev, Avi Wigderson
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We assume that for some fixed large enough integer d, the symmetric group Sd can be generated as an expander using d1/30 generators. Under this assumption, we explicitly construct an infinite family of groups Gn, and explicit sets of generators Yn ⊂ Gn, such that all generating sets have bounded size (at most d1/7), and the associated Cayley graphs are all expanders. The groups Gn above are very simple, and completely different from previous known examples of expanding groups. Indeed, Gn is (essentially) all symmetries of the d-regular tree of depth n. The proof is completely elementary, using only simple combinatorics and linear algebra. The recursive structure of the groups Gn (iterated wreath products of the alternating group Ad) allows for an inductive proof of expansion, using the group theoretic analogue [4] of the zig-zag graph product of [38]. The explicit construction of the generating sets Yn uses an efficient algorithm for solving certain equations over these groups, which relies on the work of [33] on the commutator width of perfect groups.We stress that our assumption above on weak expansion in the symmetric group is an open problem. We conjecture that it holds for all d. We discuss known results related to its likelihood in the paper.
On unions and dominants of polytopes
Authors: Egon Balas, Alexander Bockmayr, Nicolai Pisaruk, Laurence Wolsey
Venue: Mathematical Programming: Series A and B (2004)

A well-known result on unions of polyhedra in the same space gives an extended formulation in a higher-dimensional space whose projection is the convex hull of the union. Here in contrast we study the unions of polytopes in different spaces, giving a complete description of the convex hull without additional variables. When the underlying polytopes are monotone, the facets are described explicitly, generalizing results of Hong and Hooker on cardinality rules, and an efficient separation algorithm is proposed. These results are based on an explicit representation of the dominant of a polytope, and an algorithm for the separation problem for the dominant. For non-monotone polytopes, both the dominant and the union are characterized. We also give results on the unions of polymatroids both on disjoint ground sets and on the same ground set generalizing results of Conforti and Laurent.
Querying Reflexive Component-Based Architectures
Authors: Mourad Alia, Romain Lenglet, Thierry Coupaye, Alexandre Lefebvre
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

In the context of large-scale distributed component-based systems, this article motivates the need for and defines a general open query service. This query service allows for retrieving and selecting components from both repositories and deployed running systems. The problem of retrieving components from repositories has already been tackled by many research works whose purpose is to construct systems by assembling reusable components, typically in the context of COTS components. However, the proposed query services allows for an uniform efficient associative access to both repositories and running systems, while beeing based on distributed database techniques, which is the main contribution in this paper.
The Simulation of Service Supply Chain Formation Based on Mobile Agent's Searching
Authors: Zhe Yang, Dalu Zhang, Jian Xu
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

In E-Commerce, end consumers and service suppliers can find the services they needed through the searching of Mobile Agents (MA). So the suppliers can disassemble the service requests of consumers into the sub-requests. Then suppliers respond the sub-requests cooperatively. Thus the Service Supply Chain (SSC) can be built up. But the existing bottom-up and up-bottom supply chain formation fashions cannot be adapted to the distributed environment of E-Commerce. So we do some researches on the simulation of SSC formation based on MA's searching. We describe the service relationship among consumers and suppliers with Task Dependency Network. We study the influence on the formation of SSC caused by the quantities of MA and its variety in number.
The Schrödinger cat thought experiment land (the SCTE land)
Authors: J. Harri T. Tiainen
Venue: Smarandache Notions Journal (2004)

Following a short review of ten well-known objections to Sclarödinger Cat Thought Experiment, fourteen new objections are presented that show the central thought experiment of quantum mechanics violates the second law of thermodynamics. These objections are shown to be equivalent to Smarandache Sorites Paradox that is how <A> and <Non-A> are connected.
Model-checking dense-time Duration Calculus
Authors: Martin Fr&#x00e4;nzle
Venue: Formal Aspects of Computing (2004)

Since the seminal work of Zhou Chaochen, M. R. Hansen, and P. Sestoft on decidability of dense-time Duration Calculus [ZHS93] it is well known that decidable fragments of Duration Calculus can only be obtained through withdrawal of much of the interesting vocabulary of this logic. While this was formerly taken as an indication that key-press verification of implementations with respect to elaborate Duration Calculus specifications were also impossible, we show that the model property is well decidable for realistic designs which feature natural constraints on their switching dynamics.The key issue is that the classical undecidability results rely on a notion of validity of a formula that refers to a class of models which is considerably richer than the possible behaviours of actual embedded real-time systems: that of finitely variable trajectories. By analysing two suitably sparser model classes we obtain model-checking procedures for rich subsets of Duration Calculus. Together with undecidability results also obtained, this sheds light upon the exact borderline between decidability and undecidability of Duration Calculi and related logics.