ppxscal/embedding_network huggingface dataset:
On the Use of Genetic Algorithms in the Medium Access Control of Broadcast Communication Networks
Authors: G. I. Papadimitriou, M. S. Obaidat, A. S. Pomportsis
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Time Division Multiple Access protocols suffer from poor performance when the offered traffic is bursty. In this paper, an adaptive Time Division Multiple Access protocol, which is capable of operating efficiently under bursty traffic conditions, is introduced. According to the proposed protocol, the station which is granted permission to transmit at each time slot is selected by means of a variation of the well-known population-based incremental learning (PBIL) geneticalgorithm. The choice probability of the selected station is updated by taking into account the network feedback information. In this way, the proposed protocol is always capable of being adapted to the sharp changes of the station's traffic. Extensive simulation results are presented which indicate that the proposed protocol achieves a significantly higher performance than other well-known time division multiple access protocols when operating under bursty traffic conditions.
Power Supply Noise Monitor for Signal Integrity Faults
Authors: Josep Rius Vázquez, José Pineda de Gyvez
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

We propose a monitor able to detect on-line excessive Power Supply Noise (PSN) at the power/ground lines. It has high resolution (100 ps), enough to collect the important features of PSN and its output is isolated from the local PSN. It is useful for any scheme that takes corrective actions to prevent signal integrity faults after detection of excessive PSN.
Multi-dimensional range queries in sensor networks
Authors: Xin Li, Young Jin Kim, Ramesh Govindan, Wei Hong
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

In many sensor networks, data or events are named by attributes. Many of these attributes have scalar values, so one natural way to query events of interest is to use a multi-dimensional range query. An example is: "List all events whose temperature lies between 50° and 60°, and whose light levels lie between 10 and 15." Such queries are useful for correlating events occurring within the network.In this paper, we describe the design of a distributed index that scalably supports multi-dimensional range queries. Our distributed index for multi-dimensional data (or DIM) uses a novel geographic embedding of a classical index data structure, and is built upon the GPSR geographic routing algorithm. Our analysis reveals that, under reasonable assumptions about query distributions, DIMs scale quite well with network size (both insertion and query costs scale as O(√N)). In detailed simulations, we show that in practice, the insertion and query costs of other alternatives are sometimes an order of magnitude more than the costs of DIMs, even for moderately sized network. Finally, experiments on a small scale testbed validate the feasibility of DIMs.
Technology for Testing Nondeterministic Client/Server Database Applications
Authors: Gwan-Hwan Hwang, Sheng-Jen Chang, Huey-Der Chu
Venue: IEEE Transactions on Software Engineering (2004)

Abstract--The execution of a client/server application involving database access requires a sequence of database transaction events (or, T-events), called a transaction sequence (or, T-sequence). A client/server database application may have nondeterministic behavior in that multiple executions thereof with the same input may produce different T-sequences. In this paper, we present a framework for testing all possible T-sequences of a client/server database application. We first show how to define a T-sequence in order to provide sufficient information to detect race conditions between T-events. Second, we design algorithms to change the outcomes of race conditions in order to derive race variants, which are prefixes of other T-sequences. Third, we develop a prefix-based replay technique for race variants derived from T-sequences. We prove that our framework can derive all the possible T-sequences in cases where every execution of the application terminates. A formal proof and an analysis of the proposed framework are given. We describe a prototype implementation of the framework and present experimental results obtained from it.
Error Correction In Pipelined ADCS Using Arbitrary Radix Calibration
Authors: Anup Savla, Jennifer Leonard, Arun Ravindran
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper presents an ADC architecture which enhances accuracyof pipelines conversion using digital calibration.The popular1.5 bit/stage pipeline architecture is adapted to an arbitrary radixstructure.Calibration algorithms that estimate gain errors for twocomparators in each pipeline stage are developed using this architecture.A low-noise queuing technique which enables calibrationto be performed in background without interrupting the ADC input samplestream is presented.A 12-stage pipeline ADC model is used to demonstrate theeffectiveness of calibration algorithms. With 10% error in theinterstage gain, calibration improves the accuracy from 5 to 11 bits.Effects of implementation issues such as gain parameter settling,intradie gain variation, and finite word length computationare studied.
The realities of the paperwork reduction act of 1995: a government-wide strategy for information resources management
Authors: Patricia Diamond Fletcher
Venue: Public information technology: policy and management issues (2003)

The strategic management practices required for the use of information and information technologies under the Paperwork Reduction Act of 1995 (P.L. 104-13, 44 U.S.C. § 3501) comprise an important toolkit for federal agencies. There is a special need for strategic planning and management of information in an era of electronic government initiatives, homeland security, federal workforce retention problems, and inter/intragovernmental agency data sharing programs and systems. The PRA sets the policy agenda for information resources management in the US federal government and places the guidance and oversight for enacting the PRA in the Executive Office of Management and Budget (OMB). At both the level of guidance and practice, the PRA has had mixed success since it was initially signed into law in 1980. OMB has not met its statutory responsibilities under the PRA, and the federal government is left without a cohesive direction and agenda for information resources management.
Anti-swing and positioning control of overhead traveling crane
Authors: Jianqiang Yi, Naoyoshi Yubazaki, Kaoru Hirota
Venue: Information Sciences: an International Journal (2003)

A new fuzzy controller for anti-swing and position control of an overhead traveling crane is proposed based on the Single Input Rule Modules (SIRMs) dynamically connected fuzzy inference model. The trolley position and velocity, the rope swing angle and angular velocity are selected as the input items, and the trolley acceleration as the output item. Each input item is given with a SIRM and a dynamic importance degree. The control system is proved to be asymptotically stable to the destination. The controller is robust to different rope lengths and has generalization ability for different initial positions. Control simulation results show that by using the fuzzy controller, the crane is smoothly driven to the destination in short time with small swing angle and almost no overshoot.
Assessment of learner satisfaction with asynchronous electronic learning systems
Authors: Yi-Shun Wang
Venue: Information and Management (2003)

The electronic learning (e-learning) literature has not addressed the measurement of learner satisfaction with asynchronous e-learning systems. Current models for measuring user satisfaction (US) and students' evaluation of teaching effectiveness (SETE) are perceived as inapplicable as they are targeted primarily towards either organizational information sytems or classroom education environment. My study developed a comprehensive model and instrument for measuring learner satisfaction with asynchronous e-learning systems. The procedures used in conceptualizing the survey, generating items, collecting data, and validating the multiple-item scale are described. This study carefully examined evidence of reliability, content validity, criterionrelated validity, convergent validity, discriminant validity, and nomological validity by analyzing data from a sample of 116 adult respondents. The norms of the instrument were then developed, and the potential applications for practitioners and researchers explored. Finally, this paper discusses limitations of the work. The empirically validated instrument should be useful to other researchers in developing and testing their e-learning theories.
Application of an Attribute Selection Method to CBR-Based Software Quality Classification
Authors: Taghi M. Khoshgoftaar, Laurent Nguyen, Kehan Gao, Jayanth Rajeevalochanam
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

This study investigates the attribute selection problem for reducing the number of software metrics (program attributes) used by a case-based reasoning (CBR) software quality classification model. The metrics are selected using the Kolmogorov-Smirnov (K-S) two sample test. The "Modified Expected Cost of Misclassification" measure, recently proposed by ourresearch team, is used as a performance measure to select, evaluate, and compare classification models. The attribute selection procedure presented in this paper can assist a software development organization in determining the software metrics that are better indicators of software quality. By reducing the number of software metrics to be collected during the development process, the metrics data collection task can be simplified. Moreover, reducing the number of metrics would result in reducing the computation time of a cbr model. Using an empirical case study of a real-world software system, it is shown that with a reduced number of metrics the cbr technique is capable of yielding useful software quality classification models. Moreover, their performances were better than or similar to cbr models calibrated without attribute selection.
Edge-pancyclicity of recursive circulants
Authors: Toru Araki
Venue: Information Processing Letters (2003)

A graph is pancyclic if it has a cycle of length l for every 3 ≤ l ≤ |V|, and it is called edge-pancyclic if every edge lies on a cycle of length l for all l = 3, 4,..., |V|. We have shown in [Inform. Process. Lett. 81 (2002) 187-190] that the recursive circulants are pancyclic or nearly pancyclic. In this paper, we improve this result by showing that the recursive circulants are edge-pancyclic or nearly edge-pancyclic.
Reflective specification: applying a reflective language to formal specification
Authors: Motoshi Saeki, Takeshi Hiroi, Takanori Ugai
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

This paper reports on a technique for specifying concurrent systems by using a formal specification language with reflective computation mechanism. We call the specifications written by a reflective language reflective specifications. Our reflective language is an enhanced version of LOTOS (Language of Temporal Ordering Specification). We embedded reflection or reflective computation facilities to behaviour specification part of LOTOS in order to define complex behaviour in simple and natural way. Reflection in a program is a mechanism to access and modify its execution states which its executor has. Our enhanced version of LOTOS is called RLOTOS, and has two level architecture --- object level and meta level. The processes in the meta level, called meta processes, have the computational information and interpret the behaviour expressions of their object level processes. We can define meta processe in the same manner as LOTOS processes to control the behaviour of the object level processes. In this paper, we present a case study of specifying an operating system by using RLOTOS. Furthermore we discuss the method to construct comprehensive formal specifications by using reflective languages and explore the applicability of the reflective language to formal specification. The essential point of comprehensiveness is that the meta properties of the system such as control characteristics can be specified separately from the object level properties.
Multigrid for discrete differential forms on sparse grids
Authors: V. Gradinaru, R. Hiptmair
Venue: Computing (2003)

Discrete differential forms are a generalization of the common H1 (Ω)-conforming Lagrangian elements. For the latter, Galerkin schemes based on sparse grids are well known, and so are fast iterative multilevel solvers for the discrete Galerkin equations. We extend both the sparse grid idea and the design of multilevel methods to arbitrary discrete differential forms. The focus of this presentation will be on issues of efficient implementation and numerical studies of convergence of multigrid solvers.
A new switch-level test pattern generation algorithm based on single path over a graph representation
Authors: C. Ferrer, J. Oliver, E. Valderrama
Venue: Proceedings of the conference on European design automation (1990)

A new switch-level automatic test pattern generation algorithm for CMOS combinational network is presented. Such a generator can be applied to static and dynamic CMOS logics, and pseudo-NMOS ones. The fault model includes stuck-on and stuck-open transistor faults, although the algorithm can be easily generalized to open and short faults. The algorithm follows a PODEM-like strategy, and may be directly applied to a wide spread of CMOS logics. Test vector generation times have been notoriously improved, comparing with others switch-level algorithms.
Nomadic Control Packet-Based Dynamic Route Maintenance Scheme for Adaptive Routing in Mobile Ad Hoc Networks
Authors: Wook Choi, Sajal K. Das, Il ho Lee
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Many novel ideas have been proposed for designing multihoprouting protocols in MANET (Mobile Ad-hoc Networks).Many of them adopt a method, called flooding,to discover a routing path. In order to increase the overallrouting performance and make optimum use of the limitedresources, discovered routing paths need to be dynamicallymaintained to be continuously optimal in the highlydynamic network topology. However, the flooding is inappropriatefor the dynamic route maintenance due to itssignificant inherent overhead. In this paper, we propose anomadic control packet (NCP)-based dynamic route maintenancescheme for adaptive routing in MANET. The NCPtravels through the network based on a random walk, andcollects its stopovers as a traversal record for the purposeof dynamic route maintenance and efficient route discovery.The NCP probabilistically provides nodes with cluesto routing path updates by using its traversal record. Thenodes can find up-to-date and optimal (less-loaded andshorter) routing path information from the clues, therebyadapting to the dynamic network topology and traffic loadconditions. The NCP-based dynamic route maintenancescheme can be easily applied to ad hoc on-demand routingprotocols such as AODV and DSR with minimum modifications.In our simulation study we modified the AODVprotocol to maintain routing paths using NCPs' traversalrecord. The simulation results show that the utilization ofNCPs helps the routing protocol to notably reduce averageend-to-end packet delay with the help of the increased routeoptimality and traffic congestion control.
Universal homogeneous graph-like structures and domains
Authors: Paolo Boldi, Felice Cardone, Manfred Droste
Venue: Mathematical Structures in Computer Science (2002)

We present explicit constructions of universal homogeneous objects in categories of domains with stable embedding&ndash;projection pairs as arrows. These results make use of a representation of such domains through graph-like structures and apply a generalization of Rado&rsquo;s result on the existence of the universal homogeneous countable graph. In particular, we build universal homogeneous objects in the categories of coherence spaces and qualitative domains, introduced by Girard (Girard 1987; Girard 1986), and two categories of hypercoherences recently studied by Ehrhard (Ehrhard 1993). Our constructions rely on basic numerical notions. We also show that a suitable random construction of Rado&rsquo;s graph and its generalizations produces with probability 1 the universal homogeneous structures presented here.
On semi-Eulerian partially ordered sets with boundary
Authors: Beifang Chen, Mankwong Lau
Venue: European Journal of Combinatorics (2003)

Eulerian posets are motivated by the posets from triangulations of spheres; semi-Eulerian posets are motivated by the posets from triangulations of manifolds. Motivated by investigation (Proc. Natl. Acad. Sci. USA 95 (1998) 9093; Adv. Appl. Math. 19 (1997) 144; J. Combin. Theory Ser. A 85 (1999) 1; Adv. Appl. Math. 21 (1998) 22) on the number of faces of triangulations of manifolds with boundary, we introduce semi-Eulerian posers with boundary in this paper, and generalize the reciprocity laws, the Dehn-Sommerville equations, and the combinatorial Alexander duality to semi-Eulerian posets with boundary.
Improved boundary conditions for viscous, reacting, compressible flows
Authors: James C. Sutherland, Christopher A. Kennedy
Venue: Journal of Computational Physics (2003)

Previous studies on physical boundary conditions for flame-boundary interactions of an ideal, multicomponent, compressible gas have neglected reactive source terms in their boundary condition treatments. By combining analyses of incompletely parabolic systems with those based on the hyperbolic Euler equations, a rational set of boundary conditions is determined to address this shortcoming. Accompanying these conditions is a procedure for implementation into a maltidimensional code. In the limits of zero reaction rate or one species, the boundary conditions reduce in a predictable way to cases found in the literature. Application is made to premixed and nonpremixed flames in one and two dimensions to establish efficacy. Inclusion of source terms in boundary conditions derived from characteristic analysis is essential to avoid unphysical generation of pressure and velocity gradients as well as flow reversals. Minor deficiencies in the boundary conditions are attributed primarily to the diffusive terms. Imposing vanishing diffusive boundary-normal flux gradients works better than imposing vanishing fluxes but neither is entirely satisfactory.
Characterization of the partial autocorrelation function of nonstationary time series
Authors: Serge Dégerine, Sophie Lambert-Lacroix
Venue: Journal of Multivariate Analysis (2003)

The second order properties of a process are usually characterized by the autocovariance function. In the stationary case, the parameterization by the partial autocorrelation function is relatively recent. We extend this parameterization to the nonstationary case. The advantage of this function is that it is subject to very simple constraints in comparison with the autocovariance function which must be nonnegative definite. As in the stationary case, this parameterization is well adapted to autoregressive models or to the identification of deterministic processes.
Multiprocessor Architectures for Embedded System-on-chip Applications
Authors: C. P. Ravikumar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Real-time multimedia applications that involveprocessing of video and audio streams demandcomputational performance of a few Giga operationsper second, which cannot be obtained using a singleprocessor. An embedded system intended for such anapplication must also support networking and IOinterfaces, which are best handled by dedicatedinterface processors that are coordinated by a house-keepingprocessor. Dedicated processors may also benecessary for parsing and processing video/audiostream and, video/graphics rendering. In this paper,we provide an overview of multiprocessorarchitectures that are evolving for such embeddedapplications. We argue that the VLSI designchallenges involved in designing an equivalentuniprocessor solution for the same application maymake such a solution prohibitively expensive, makingmultiprocessor SoC an attractive alternative.
Sufficient conditions for a scheme to originate from a group
Authors: Mitsugu Hirasaka, Paul-Hermann Zieschang
Venue: Journal of Combinatorial Theory Series A (2003)

We present two different sufficient conditions for a scheme to originate from a transitive permutation group.
Carry Circuitry for LUT-Based FPGA
Authors: Varun Jindal, Alpana Agarwal
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper presents a carry chain designoptimized for implementing multipliers along with theadder circuitry. This kind of architecture will be veryuseful for designs which have very large number ofmathematical operations in it. The aim of the architectureis to accommodate as much logic as possible in one LUTwithout increasing the size of the LUT proportionately.The discussed carry chain design is compatible with both3-input as well as 4-input LUTs. The paper ends with acomparative study of multiplier implementation onvarious popular FPGA architectures.
Analysis and design of high-speed high-resolution analog-to-digital converter
Authors: Jing Wang
Venue:  (2003)

A pipeline ADC (Analog-to-Digital Converter) architecture is proposed. The ADC is composed of a unique first stage and a conventional second stage. A track-hold and an operational amplifier have been proposed to be used in the ADC system. The first stage is implemented in the transistor level. It can generate an analog residue at 10-bit accuracy level with 100MHz sampling frequency. The track-hold has a 14-bit linearity with 13MHz input frequency and 100MHz sampling frequency. The power supply is +/&minus;1.65V for the overall system. The circuits are designed using a 0.18 &mu;m digital CMOS process and the layout is finished. Two chips have been fabricated and tested. The track-hold chip consumes 23.76mW power from a +/&minus;1.65 V power supply. The track-hold has 11-bit resolution. The ADC chip is functional with the proposed track-hold. The results proved the research ideas.
Electric properties of substituted diacetylenes
Authors: P. Karamanis, G. Maroulis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

A systematic study of the electric properties of substituted diacetylenes: H-C≡C-C≡C-X, -X = Li, Na, K, Al, Ga, In, F, Cl, Br, I, CN, NC, CP, PC, C6H5, C4N, C5H4N and N2B is presented. The electric properties that have been studied are the dipole moment (µα) the dipole polarizability (ααβ), the first (βαβγ) and the second (γαβγδ) dipole hyperpolarizability. The calculations have been performed with ab initio methods (Møller-Plesset Perturbation theory, Coupled Cluster techniques) of high predictive capability and flexible basis sets especially designed for (hyper)polarizability calculations.