ppxscal/embedding_network huggingface dataset:
Cycle Compensation Protocol: A Fair Protocol for the Unidirectional Twin-Bus Architecture
Authors: Yean-Shiang Leu, D. H. C. Du
Venue: IEEE Transactions on Computers (1994)

The IEEE 802.6 Standard/spl minus/Distributed Queue Dual Bus (DQDB)/sup 1//spl minus/for metropolitan area networks (MAN's) has been proposed. It is based on a unidirectional twin bus architecture. The DQDB protocol lays more emphasis on the overall channel utilization than the fair sharing of channel bandwidth by all the stations. In this paper, we first describe the unfairness problem in which the upstream stations occupy most of the channel bandwidth while the downstream stations get fewer chances to transmit their packets. Many proposed possible fixes are also discussed. We propose a protocol called Cycle Compensation Protocol (CCP), which ensures fairness regardless of the ratio of end-to-end propagation delay to the slot size and also achieves almost the same throughput and delay as those of DQDB. CCP also guarantees that the channel bandwidth acquired by a station is inversely proportional to the number of busy stations and will reach this state within a limited time delay.
Maintenance-Oriented Design and Development: A Case Study
Authors: José Pablo Zagal, Raúl Santelices Ahués, Miguel Nussbaum Voehl
Venue: IEEE Software (2002)

It is a general consensus that maintenance efforts are the most time and resource consuming of the entire software development process. Maintenance is regarded as the last, and least rewarding, step of software development. We propose a different point of view wherein we shift from the traditional perspective and think of the implementation stage as maintenance as well. This means viewing software development as design followed by maintenance; don't design what will be implemented, but what will be maintained.We present this perspective through an experience in the development of educational video games for children. We use this example to compare both traditional and maintenance-oriented processes, determining the proposed method's benefits and drawbacks in the video game domain. We present and analyze two tools in which the concept of a specific computer-aided software engineering tool (SCASE) is present. These are tools that were designed with maintenance specifically in mind.We conclude that taking into consideration the importance of maintenance, as well as focusing the development process toward it, is a great boon toward the development of software projects that are successful, on time, and on budget.
Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets
Authors: E. A. Varvarigos, D. T. Bertsekas
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Multinode broadcast (MNB) in a hypercube and in a ring network of processors isconsidered. It is assumed that the lengths of the packets that are broadcast are notfixed, but are distributed according to some probabilistic rule, and the optimal timesrequired to execute the MNB are compared for variable and for fixed packet lengths. Forlarge hypercubes, it is shown, under very general probabilistic assumptions on the packetlengths, that the MNB is completed in essentially the same time as when the packetlengths are fixed. In particular, the MNB is completed by time (1+ delta )T/sub s/ withprobability at least 1- epsilon , for any positive epsilon and delta , where T/sub s /is theoptimal time required to execute the MNB when the packet lengths are fixed at theirmean, provided that the size of the hypercube is large enough. In the case of the ring, itis proved that the average time required to execute a MNB when the packet lengths areexponentially distributed exceeds by a factor of ln n the corresponding time for the casethere the packet lengths are fixed at their mean, where n is the number of nodes of thering.
Methodological and ethical challenges of researching a computer-mediated group
Authors: Sharon S. Kleinman
Venue: Journal of Technology in Human Services (2002)

People are increasingly using e-mail technology to join computer-mediated groups, and these groups are gaining the attention of researchers from diverse fields. Researchers are adapting techniques used to study "traditional" contexts, such as face-to-face groups, and devising strategies for meeting the methodological and ethical challenges of studying online interactions. Because studying computer-mediated groups is still a relatively new endeavor, research standards have not yet been codified. Some researchers of computer-mediated groups seem to be unreflexive about the fact that there are real people behind the computer screens who can be affected by the research process-positively or negatively. This paper closely examines one study of a computer-mediated group that used multiple methods, discusses the rationale for decisions made about the research design and procedures, and provides suggestions for scholars interested in studying computer-mediated groups.
Stepwise Refinement and Problem Solving
Authors: Robert G. Reynolds, Jonathan I. Maletic, Stephen E. Porvin
Venue: IEEE Software (1992)

The possibility of reexpressing the traditional notion of stepwise refinement as a combination of general problem-solving activities that are based on paradigms taken from artificial intelligence research is discussed. This reexpression can form the basis for a more explicit view of programming as a problem-solving activity. Experiments in which each step of the refinement process is encoded into problem solving activities are described. 26 examples of code implementation using the stepwise refinement of pseudocode have been analyzed. The presence of certain combinations of activities suggest that programmers are implicitly emulating certain paradigms that have proved useful in solving complex problems. Also, a particular paradigm and its associated activities seem to be applied often throughout the refinement sequence for a given problem. The nature of the problem to be solved influences the type of activities performed to achieve a solution, as well as the problem-solving paradigm that they implicitly support.
Gray-Scale ALIAS
Authors: P. Bock, R. Klinnert, R. Kober, R. M. Rovner, H. Schmidt
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

Based on the paradigm of collective learning systems, ALIAS (adaptive learning image analysis system) is an adaptive image-processing engine specifically designed to detect anomalies in otherwise normal images and signals. To accomplish this, ALIAS requires only one pass through a training set, which typically consists of less than 100 samples. The original version of ALIAS (1.0) was completed in Apr. 1990 at the Research Institute for Applied Knowledge Processing (FAW) in Ulm, Germany.
Hardware-Software Cosynthesis for Digital Systems
Authors: Rajesh K. Gupta, Giovanni De Micheli
Venue: IEEE Design Test (1993)

As system design grows increasingly complex, the use of predesigned components, such as general-purpose microprocessors can simplify synthesized hardware. While the problems in designing systems that contain processors and application-specific integrated circuit chips are not new, computer-aided synthesis of such heterogeneous or mixed systems poses unique problems. The authors demonstrate the feasibility of synthesizing heterogeneous systems by using timing constraints to delegate tasks between hardware and software so that performance requirements can be met. System functionality is captured using the HardwareC hardware description language. The synthesis of an Ethernet-based network coprocessor is discussed as an example.
Instruction generation for hybrid reconfigurable systems
Authors: R. Kastner, A. Kaplan, S. Ogrenci Memik, E. Bozorgzadeh
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2002)

Future computing systems need to balance flexibility, specialization, and performance in order to meet market demands and the computing power required by new applications. Instruction generation is a vital component for determining these trade-offs. In this work, we present theory and an algorithm for instruction generation. The algorithm profiles a dataflow graph and iteratively contracts edges to create the templates. We discuss how to target the algorithm toward the novel problem of instruction generation for hybrid reconfigurable systems. In particular, we target the Strategically Programmable System, which embeds complex computational units such as ALUs, IP blocks, and so on into a configurable fabric. We argue that an essential compilation step for these systems is instruction generation, as it is needed to specify the functionality of the embedded computational units. In addition, instruction generation can be used to create soft reconfigurable macros---tightly sequenced prespecified operations placed in the reconfigurable fabric.
Path-Based Error Coverage Prediction
Authors: Joakim Aidemark, Peter Folkesson, Johan Karlsson
Venue: Journal of Electronic Testing: Theory and Applications (2002)

We present an analytical technique that uses fault injection data for estimating the coverage of concurrent error detection mechanisms in microprocessors. A major problem in such estimations is that the coverage depends on the program executed by the microprocessor as well as the input sequence to the program. We propose a method that predicts the error coverage for a specified input sequence based on fault injection data obtained for another input sequence. Our results show that post-injection analysis is a promising approach for reducing the cost of coverage estimation.
Topological Invariants for Lines
Authors: Eliseo Clementini, Paolino Di Felice
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

A set of topological invariants for relations between lines embedded in the 2-dimensional Euclidean space is given. The set of invariants is proven to be necessary and sufficient to characterize topological equivalence classes of binary relations between simple lines. The topology of arbitrarily complex geometric scenes is described with a variation of the same set of invariants. Polynomial time algorithms are given to assess topological equivalence of two scenes. The relevance of identifying such a set of invariants and efficient algorithms is due to application areas of spatial database systems, where a model for describing topological relations between planar features is sought.
Behavior-to-placed RTL synthesis with performance-driven placement
Authors: Daehong Kim, Jinyong Jung, Sunghyun Lee, Jinhwan Jeon, Kiyoung Choi
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Interconnect delay should be considered together with computation delay during architectural synthesis in order to achieve timing closure in deep submicrometer technology. In this paper, we propose an architectural synthesis technique for distributed-register architecture, which separates interconnect delay for data transfer from component delay for computation. The technique incorporates performance-driven placement into the architectural synthesis to minimize performance overhead due to interconnect delay. Experimental results show that our methodology achieves performance improvement of up to 60% and 22% on the average.
An Adaptive Checkpointing Scheme for Distributed Databases with Mixed Types of Transactions
Authors: S. H. Son
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

A checkpointing algorithm that is noninterfering with transaction processing is presented. It prevents the well-known domino effect and saves the intermediate results of a long-lived transaction in an adaptive manner, managing effectively both short- and long-lived transactions in the system.
Algebraic Identities and Query Optimization in a Parametric Model for Relational Temporal Databases
Authors: Shashi K. Gadia, Sunil S. Nair
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

This paper presents algebraic identities and algebraic query optimization for a parametric model for temporal databases. The parametric model has several features not present in the classical model. In this model, a key is explicitly designated with a relation, and an operator is available to change the key. The algebra for the parametric model is three-sorted; it includes 1) relational expressions that evaluate to relations, 2) domain expressions that evaluate to time domains, and 3) Boolean expressions that evaluate to TRUE or FALSE. The identities in the parametric model are classified as weak identities and strong identities. Weak identities in this model are largely counterparts of the identities in classical relational databases. Rather than establishing weak identities from scratch, a meta inference mechanism, introduced in the paper, allows weak identities to be induced from their respective classical counterpart. On the other hand, the strong identities will be established from scratch. An algorithm is presented for algebraic optimization to transform a query to an equivalent query that will execute more efficiently.
On the relationship between strand spaces and multi-agent systems
Authors: Joseph Y. Halpern, Riccardo Pucella
Venue: ACM Transactions on Information and System Security (TISSEC) (2003)

Strand spaces are a popular framework for the analysis of security protocols. Strand spaces have some similarities to a formalism used successfully to model protocols for distributed systems, namely multi-agent systems. We explore the exact relationship between these two frameworks here. It turns out that a key difference is the handling of agents, which are unspecified in strand spaces and explicit in multi-agent systems. We provide a family of translations from strand spaces to multi-agent systems parameterized by the choice of agents in the strand space. We also show that not every multi-agent system of interest can be expressed as a strand space. This reveals a lack of expressiveness in the strand-space framework that can be characterized by our translation. To highlight this lack of expressiveness, we show one simple way in which strand spaces can be extended to model more systems.
Organizational Benchmarking Using the ISBSG Data Repository
Authors: Chris Lokan, Terry Wright, Peter R. Hill, Michael Stringer
Venue: IEEE Software (2001)

In 1999, an organization contributed a large group of enhancement projects to the International Software Benchmarking Standards Group's Data Repository. The contributing organization received an individual benchmark report for each project, comparing it to the most relevant projects in the repository. The ISBSG also performed an organizational benchmarking exercise that compared the organization's set of 60 projects as a whole to the repository as a whole. The benchmarking exercise aimed to provide valuable information to the organization and to measure the benchmarking exercise's effectiveness given the repository's anonymous nature.
On Job Scheduling on a Hypercube
Authors: Y. Zhu, M. Ahuja
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The problem of scheduling n independent jobs on an m-dimensional hypercube system to minimize the finish time is studied. Each job J/sub i/, where 1>or=i>or=n, is associated with a dimension d/sub i/ and a processing time t/sub i/, meaning that J/sub i/ needs a d/sub i/-dimensional subcube for t/sub i/ units of time. When job preemption is allowed, an O(n/sup 2/ log/sup 2/ n) time algorithm which can generate a minimum finish time schedule with at most min(n-2,2/sup m/-1) preemptions is obtained. When job preemption is not allowed, the problem is NP-complete. It is shown that a simple list scheduling algorithm called LDF can perform asymptotically optimally and has an absolute bound no worse than 2-1/2/sup m/. For the absolute bound, it is also shown that there is a lower bound (1+ square root 6)/2 approximately=1.7247 for a class of scheduling algorithms including LDF.
Blondie-III
Authors: Gidi van Liempd, Hugo Velthuijsen, Adriana Florescu
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

A distributed blackboard implementation that addresses the following network configuration problem is described. Telecommunication network managers at the Dutch PTT are regularly asked to install new connections between a group of users and a specific application. Several pieces of equipment have to be assembled. Choosing the specific pieces and types of equipment depends on many factors, and these choices are difficult because of the large number of constraints and the different kinds of equipment available. A distributed approach was chosen because of the problem domain's inherently distributed character, and a blackboard architecture because of its suitability for distributed AI systems, planning problems, and incremental system development. The system was implemented in the distributed blackboard environment, Blondie-III, as part of a larger project researching distributed AI. The problem is described in some detail, the reasons for using a distributed blackboard system to solve it are discussed, and the implementation and its evaluation are presented. The system's most striking feature is not the distribution of the problem-solving process, but the way search is conducted on the blackboard, as well as the natural integration of several types of knowledge (including rule-based and procedural knowledge).
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures
Authors: G. C. Sih, E. A. Lee
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The authors present a compile-time scheduling heuristic called dynamic level scheduling,which accounts for interprocessor communication overhead when mappingprecedence-constrained, communicating tasks onto heterogeneous processorarchitectures with limited or possibly irregular interconnection structures. This techniqueuses dynamically-changing priorities to match tasks with processors at each step, andschedules over both spatial and temporal dimensions to eliminate shared resourcecontention. This method is fast, flexible, widely targetable, and displays promisingperformance.
A Fully Automatic hp-Adaptivity
Authors: L. Demkowicz, W. Rachowicz, Ph. Devloo
Venue: Journal of Scientific Computing (2002)

We present an algorithm, and a 2D implementation for a fully automatic hp-adaptive strategy for elliptic problems. Given a mesh, the next, optimally refined mesh, is determined by maximizing the rate of decrease of the hp-interpolation error for a reference solution. Numerical results confirm optimal, exponential convergence rates predicted by the theory of hp methods.
Cryptographic Design Vulnerabilities
Authors: Bruce Schneier
Venue: Computer (1998)

Popular magazines often describe cryptography products in terms of algorithms and key lengths. These security techniques make good headlines ("Triple DES is much stronger than single DES."). Unfortunately, cryptography isn't so simple: Longer keys do not guarantee more security. Compare a cryptographic algorithm to the lock on your front door. Improving the lock probably won't make your house more secure. Burglars don't try every possible key (the equivalent of a brute-force attack); most aren't clever enough to pick the lock (the equivalent of a cryptographic attack). No, burglars smash windows, kick in doors, disguise themselves as police, and rob key-holders at gunpoint. Strong cryptography is very powerful when it is done right, but it is not a panacea. Building a secure cryptographic system is easy to do badly and very difficult to do well. Unfortunately, most people can't tell the difference. In this article, the author conveys some of the lessons learned in designing, analyzing, and breaking cryptographic systems.
Efficient EREW PRAM Algorithms for Parentheses-Matching
Authors: S. K. Prasad, S. K. Das, C. C. Y. Chen
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We present four polylog-time parallel algorithms for matching parentheses on anexclusive-read and exclusive-write (EREW) parallel random-access machine (PRAM)model. These algorithms provide new insights into the parentheses-matching problem.The first algorithm has a time complexity of O(log/sup 2/ n) employing O(n/(log n))processors for an input string containing n parentheses. Although this algorithm is notcost-optimal, it is extremely simple to implement. The remaining three algorithms, whichare based on a different approach, achieve O(log n) time complexity in each case, andrepresent successive improvements. The second algorithm requires O(n) processors andworking space, and it is comparable to the first algorithm in its ease of implementation.The third algorithm uses O(n/(log n)) processors and O(n log n) space. Thus, it iscost-optimal, but uses extra space compared to the standard stack-based sequentialalgorithm. The last algorithm reduces the space complexity to O(n) while maintaining thesame processor and time complexities. Compared to other existing time-optimal algorithms for the parentheses-matching problem that either employ extensive pipelining or use linked lists and comparable data structures, and employ sorting or a linked list ranking algorithm as subroutines, the last two algorithms have two distinct advantages. First, these algorithms employ arrays as their basic data structures, and second, they do not use any pipelining, sorting, or linked list ranking algorithms.
Mid-sagittal cut to area function transformations: direct measurements of mid-sagittal distance and area with MRI
Authors: A. Soquet, V. Lecuit, T. Metens, D. Demolin
Venue: Speech Communication (2002)

This paper presents a comparative study of transformations used to compute the area of cross-sections of the vocal tract from the mid-sagittal measurements of the vocal tract. MRI techniques have been used to obtain both mid-sagittal distances and cross-sections of the vocal tract for French oral vowels uttered by two subjects. The measured cross-sectional areas can thus be compared to the cross-sectional areas computed by the different transformations. The evaluation is performed with a jackknife method where the parameters of the transformation are estimated from all but one measurement of a speaker's vocal tract region and evaluated on the remaining measurement. This procedure allows the study of both the performance of the different forms of transformation as a function of the vocal tract region and the stability of the transformation parameters for a given vocal tract region. Three different forms of transformation are compared: linear, polynomial and power function. The estimation performances are also compared with four existing transformations.
Multilevel Testing for Design Verification of Embedded Systems
Authors: Stephan Schulz, Jerzy W. Rozenbilt, Klaus J. Buchenrieder
Venue: IEEE Design Test (2002)

A multilevel testing approach for embedded systems addresses mixed hardware and software implementations. Contrary to conventional approaches, it provides consistent generation of scenarios throughout all levels of testing, an early assessment of alternative design implementations, integrated system and component testing, and performance assessments of design specifications starting from the system level.