ppxscal/embedding_network huggingface dataset:
Degree of scalability: scalable reconfigurable mesh algorithms for multiple addition and matrix-vector multiplication
Authors: Ramachandran Vaidyanathan, Jerry L. Trahan, Chun-ming Lu
Venue: Parallel Computing (2003)

The usual concern when scaling an algorithm on a parallel model of computation is preserving efficiency while increasing or decreasing the number of processors. Many algorithms for reconfigurable models, however, attain constant time at the expense of an inefficient algorithm. For these algorithms, scaling down the number of processors while preserving inefficiency is no benefit once constant time execution is lost. In fact, one can often accelerate the efficiency of these algorithms while reducing the number of processors. To quantify this improvement in efficiency, this paper introduces the measure of degree of scalability to complement the insight obtained from efficiency for such algorithms. Demonstrating the utility of this measure, we present new reconfigurable mesh (R-Mesh) algorithms for multiple addition and matrix-vector multiplication, improving both the number of processors and the degree of scalability compared to previous algorithms. We also extend these results to floating point number operands, which have previously received little attention on the R-Mesh.
Parallel Complexity of Additive Location Problems
Authors: Igor Averbakh, Oded Berman
Venue: INFORMS Journal on Computing (1999)

Parallel NC-algorithms for a general class of multifacility location problems on a tree with identical facilities and the minisum objective function are presented. The class includes the p-median problem, the p-coverage problem, and the uncapacitated plant location problem.
On the Convergence of Difference Schemes for Hyperbolic Problems with Concentrated Data
Authors: Bosko S. Jovanovic, Lubin G. Vulkov
Venue: SIAM Journal on Numerical Analysis (2003)

Hyperbolic equations with unbounded coefficients and even generalized functions (in particular, Dirac-delta functions) occur both naturally and artificially and must be treated in numerical schemes. An abstract operator method is proposed for studying these equations. For finite difference schemes approximating several one-dimensional initial-boundary value problems convergence rate estimates in special discrete energetic Sobolev's norms, compatible with the smoothness of the solutions, are obtained.
The Gegenbauer polynomials and typically real functions
Authors: K. Kiepiela, I. Naraniecka, J. Szynal
Venue: Journal of Computational and Applied Mathematics (2003)

Linear and nonlinear coefficient problems for some class of typically real functions are studied. Different inequalities for the Gegenbauer polynomials appear to be very useful.
Detecting and Locating Near-Optimal Almost-Invariant Sets and Cycles
Authors: Gary Froyland, Michael Dellnitz
Venue: SIAM Journal on Scientific Computing (2002)

The behaviors of trajectories of nonlinear dynamical systems are notoriously hard to characterize and predict. Rather than characterizing dynamical behavior at the level of trajectories, we consider following the evolution of sets. There are often collections of sets that behave in a very predictable way, in spite of the fact that individual trajectories are entirely unpredictable. Such special collections of sets are invisible to studies of long trajectories. We describe a global set-oriented method to detect and locate these large dynamical structures. Our approach is a marriage of new ideas in modern dynamical systems theory and the novel application of graph dissection algorithms.
Variations on extending partially defined boolean functions with missing bits
Authors: Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
Venue: Information and Computation (2003)

In this paper we consider four possible definitions for extending a partially defined Boolean function in which the input contains some missing bits. We show somewhat surprisingly that, for many general and frequently used families of function classes, three of these notions of an extension are mathematically equivalent, though such an equivalence does not hold universally, as demonstrated by several examples.
Bandwidth-adjusted LPC analysis for robust speech recognition
Authors: Chao-Shih Huang, Hsiao-Chuan Wang
Venue: Pattern Recognition Letters (2003)

This paper proposes a novel approach, bandwidth-adjusted linear predictive coding (BLPC) analysis, for robust speech recognition. We estimate and adjust the dispersion of formant bandwidths according to the maximum likelihood criteria. Our preliminary results show that the proposed BLPC can provide better performance than the traditional linear predictive coding does in noisy environments.
Angle counts for isothetic polygons and polyhedra
Authors: Ben Yip, Reinhard Klette
Venue: Pattern Recognition Letters (2003)

In the case of isothetic simple polyhedra there are only six different types of 3D angles. This article states and proofs a formula about counts of these angles. This complements formulas in combinatorial topology such as Euler's polyhedron formula, or the previously known formula on angle counts for isothetic polygons. The latter formula and the shown equality for angle counts of isothetic simple polyhedra are useful formulas for analyzing isothetic boundaries in 2D digital images (e.g. classification into inner (boundary of a hole) or outer boundaries, see Voss [Discrete Images, Objects, and Functions in Zn Springer, Berlin, 1993]) and isothetic surfaces in 3D digital images (e.g. necessary condition for a complete surface scan).
Development of Control Mechanisms of Objects with the Flow Technology on the Basis of Event Models of Channels
Authors: A. A. Ambartsumyan, A. I. Potekhin
Venue: Automation and Remote Control (2003)

For a basic element of the decomposition of a complex technological network, an event model of a channel (a pipeline including the built-in equipment) is suggested. It is shown how to structurize the control of processes in the technological network on the basis of a channel model in combination with event models of units and technological installations of an object with the flow technology. Mechanisms of control of the technological network as a collection of units, channels, and technological installations are worked out. Examples are given to illustrate the suggested models and mechanisms.
Synthesis and characterization of optically nonlinear and light emitting Lanthanide borates
Authors: Henry G. Giesber, John Ballato, William T. Pennington, Joseph W. Kolis
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

Lanthanide borates, LnBO3 (Ln = La, Pr and Nd), were prepared via supercritical hydrothermal methods in sizes up to 3 × 0.5 × 0.5 mm and their crystallography and physical and optical properties studies. The materials are thermally stable up to at least 1000 °C and their crystal structure, although previously thought to be centric orthorhombic, is shown to be orthorhombic yet acentric as is confirmed by the observance of second harmonic generated light. Absorption and luminescence from the NdBO3 and PrBO3 is provided and discussed, as is the corroboration that these materials have bandgaps well above 5 eV. This works marks the lanthanide borates as candidate materials for deep-UV and nonlinear optical applications.
Quality and Time-to-Market Trade-offs when There Are Multiple Product Generations
Authors: Leslie Olin Morgan, Ruskin M. Morgan, William L. Moore
Venue: Manufacturing Service Operations Management (2001)

We extend previous work evaluating the quality versus time-to-market trade-off for a single product generation to the case of multiple generations. While a single generation framework is appropriate when either the technology is not extendable or when additional launch costs outweigh benefits, we find that it is important to recognize whether a technology is extendable and explicitly consider the potential for multiple generations. We evaluate the factors determining optimal development-cycle length and intensity using a forward-looking model that allows for multiple product generations. Comparisons are made with restricted versions of the model that reflect pure single generation and sequential single generation approaches. Against an active competitor, the multiple generation approach is much more profitable, with the greatest differences in fast-moving industries.More total time is spent in development when a multiple generation model is used. Further, this time is dedicated to the more frequent introduction of improved product generations--a "rapid inch-up" strategy--resulting in more, higher quality products over time. Factors affecting optimal time-to-market differ substantially for the single versus multiple generation approaches. A key difference is that faster rates of quality improvement lead to longer development cycles for the single and sequential single generation models, but shorter cycles with the forward-looking multiple generation model. With a single generation, variable costs have the biggest impact on cycle length ( higher costsshorten cycles), but with multiple generations, fixed costs have the biggest impact on cycle length ( higher costs lead tolonger cycles).
Multi-objective design space exploration using genetic algorithms
Authors: Maurizio Palesi, Tony Givargis
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

In this work, we provide a technique for efficiently exploring a parameterized system-on-a-chip (SoC) architecture to find all Pareto-optimal configurations in a multi-objective design space. Globally, our approach uses a parameter dependency model of our target parameterized SoC architecture to extensively prune non-optimal sub-spaces. Locally, our approach applies Genetic Algorithms (GAs) to discover Pareto-optimal configurations within the remaining design points. The computed Pareto-optimal configurations will represent the range of performance (e.g., timing and power) tradeoffs that are obtainable by adjusting parameter values for a fixed application that is mapped on the parameterized SoC architecture. We have successfully applied our technique to explore Pareto-optimal configurations for a number of applications mapped on a parameterized SoC architecture.
Mobility of Context for Project Teams
Authors: Schahram Dustdar
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In the last decade, bureaucratic organizational hierarchies increasingly have been replaced with flatter organizational forms, bringing together people from different disciplines to form project teams within and between organizations. Distributed project teams often are self-configuring networks of mobile and "fixed" people, devices, and applications. They are the natural next step in the evolution of distributed computing, after client-server, Web-based, and peer-to-peer computing. A newly emerging requirement is to facilitate not just mobility of content (i.e. to support a multitude of devices and connectivity modes) to project members, but also mobility of context (i.e. to provide traceable and continuous support of relationshipsbetween people, artifacts, and business processes). The contribution of this paper is to present the design goals, the architecture, and implementation of a system aiming at supporting mobility of context for project teams, enabling traceable and continuous support ofassociations (relationships) between people, artifacts, and business processes.
Diversification and the Legal Organization of the Firm
Authors: Jennifer E. Bethel, Julia Porter Liebeskind
Venue: Organization Science (1998)

The existing literature on the relationship between strategy and structure tends to ignore the legal dimension of the organization of diversified firms. Yet, there is considerable variation in the legal organization of diversified firms; while some of these firms are organized as simple corporations, many are organized as "corporate groups" in which certain lines of business are organized as separate, subsidiary firms. In this paper we argue that this variation in legal organization is observed because legal organization can significantly affect firm value. In particular, forming subsidiary firms to accommodate new businesses can protect the outstanding stakeholders of a diversified firm from increases in bankruptcy risk and liability exposure. However, forming subsidiary firms also reduces economies of scope. Hence, there are offsetting costs and benefits to adopting different types of legal organization. Changes in these relative costs and benefits over time can also be expected to trigger changes in legal organization, as well as the divestiture of businesses characterized by particular types of economic hazards.
A new scheme for traffic estimation and resource allocation for bandwidth brokers
Authors: T. Anjali, C. Scoglio, G. Uhl
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

This paper is motivated by the concern of a multi-service network provider who plans to offer quality of service guarantees to users. A bandwidth broker acts as the resource manager for each network provider. Neighboring bandwidth brokers communicate with each other to establish inter-domain resource reservation agreements. Conventional approaches for resource allocation rely on pre-determined traffic characteristics. If allocation follows the traffic demand very tightly, the resource usage is efficient but leads to frequent modifications of the reservations. This would lead to increased inter-bandwidth-broker signaling in order to propagate the changes to all the concerned networks. Contrarily, if large cushions are allowed in the reservations, the modifications are far spaced in time but the resource usage becomes highly inefficient. In this paper, a new scheme for estimating the traffic on an inter-domain link and forecasting its capacity requirement, based on a measurement of the current usage, is proposed. The method allows an efficient resource utilization while keeping the number of reservation modifications to low values.
Visualization tools to support data communications and computer network courses
Authors: Curt M. White
Venue: Journal of Computing Sciences in Colleges (2001)

Many published papers, conference presentations, and books have introduced the concepts and advantages of visualization, applied visualization techniques to various areas of study, measured the effects of visualization on a student=s ability to learn, and introduced visualization tools that can be used in both the commercial and education environments. In an effort to create a set of visualization tools for teaching a data communications and computer networks course, this paper will introduce a set of eleven computer based training (CBT) modules. The collection of eleven computer based training modules presented in this paper were designed to best assist a student enrolled in an introductory computer networks course. To determine if the interactive modules assisted a student during such a course, an informal study was performed. The results of that study, along with future plans, are also presented.
A systematic approach to classifier selection on combining multiple classifiers for handwritten digit recognition
Authors: Jongryeol Kim, Kukhwan Seo, Kyusik Chung
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Much research has been done on combining multiple classifiers for handwritten character recognition to improve the performance of the classifier. Given a fixed set of classifiers using the same or different kinds of feature set, they focus on a methodology to combine all of the classifiers. In this paper, given a variable set of classifiers, we focus on a methodology to determine which subset of classifiers achieves the optimal combination results. In order to evaluate the dependency between classifiers, we propose a similarity measure between them which can be calculated from the errors generated by each classifier. This similarity measure allows us to compare the performance of one combination case relative to those of the other cases without performing any experiments. Using five individual neural net classifiers with different feature sets [gradient, structural, UDLRH (up-down left-right hole), mesh and LSF (large stroke feature)], we perform handwritten digit recognition experiments. With three combination methods [majority voting, Borda count and LCA (linear confidence accumulation)], we perform combination experiments for all possible cases of three classifiers selected from among the above five. Then, we compare their rankings in terms of the recognition rate with that in terms of the similarity measure. This comparison shows the effectiveness of the proposed method.
MDM/KDD2002: multimedia data mining between promises and problems
Authors: Simeon J. Simoff, Chabane Djeraba, Osmar R. Zaïane
Venue: ACM SIGKDD Explorations Newsletter (2002)

This report presents a brief overview of multimedia data mining and the corresponding workshop series at ACM SIGKDD conference series on data mining and knowledge discovery. It summarizes the presentations, conclusions and directions for future work that were discussed during the 3rd edition of the International Workshop on Multimedia Data Mining, conducted in conjunction with KDD-2002 in Edmonton, Alberta, Canada.
Extraction and transfer of fuzzy control rules for sensor-based robotic operations
Authors: Jianwei Zhang, Markus Ferch
Venue: Fuzzy Sets and Systems (2003)

Human beings can easily describe their control behaviours with IF-THEN rules, which can be transferred to similar tasks with only slight local changes. However, standard techniques for function approximation like neural networks or associative memories are unable to work with rules. We introduce a method for extracting and importing rules from and to a B-spline fuzzy controller. Rule importation is used to initialise a B-spline fuzzy controller with a priori knowledge to reduce the learning time and to improve the poor generalisation capability. Through "learning-by-doing" and "learning-from-others", set of rules for a two-arm cooperation task can be generated and further transferred to a robot screwing operation and a three-arm cooperation. The successful experiments show how rule-based knowledge can be used for skill transfer in analogue tasks to help significantly accelerating a learning process.
A New Light-Based Logic IC Screening Method
Authors: Shigeru Ohnishi, Michinori Nishihara
Venue: Proceedings of the 15th IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2000)

This paper describes a new screening method to combine Idd leakage current testing with light exposure on the surface of CMOS logic chips. The relationship between light and Idd leakage current is well known, and this new screening method makes use of the relationship. The Idd leakage current is tested both with and without light on the surface of the device under test (DUT). Then the measured values are compared, and there is a clear difference in these measurements for good and bad devices. By carefully analyzing these measurements, a new screening method was developed and implemented in the production line to reduce testing time and cost.
Correlation analysis of a discrete-time flexible arrival process
Authors: Sebastià Galmés, Ramon Puigjaner
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

In this paper, a flexible discrete-time arrival process is introduced and its correlation properties are analyzed. The arrival process is the so-called batch-on/off model, an extension of the original on/off source used in the context of ATM networks. In the batch-on/off model, a group of arrivals may be generated at any given active slot. General distributions are assumed for the three input random variables characterizing the process: busy and idle periods, and batch size. The analysis focuses on two related processes: the process of counts and the sequence of interarrival times. For each process, an exact closed-form expression of its complete autocorrelation function is obtained. Explicit algorithms are provided to compute both autocorrelation functions, which are numerically evaluated for different distributions of the busy and idle periods and the batch size. The results provided in this paper reveal the analytical tractability of these models which, in addition to their flexibility, makes them very suitable for the performance evaluation of discrete-time communication systems and for general research in the area of queuing theory.
Exploiting random walks for learning
Authors: Peter L. Bartlett, Paul Fischer, Klaus-Uwe Höffgen
Venue: Information and Computation (2002)

In this paper we consider an approach to passive learning. In contrast to the classical PAC model we do not assume that the examples are independently drawn according to an underlying distribution, but that they are generated by a time-driven process. We define deterministic and probabilistic learning models of this sort and investigate the relationships between them and with other models. The fact that successive examples are related can often be used to gain additional information similar to the information gained by membership queries. We show how this can be used to design on-line prediction algorithms. In particular, we present efficient algorithms for exactly identifying Boolean threshold functions and 2-term RSE, and for learning 2-term-DNF, when the examples are generated by a random walk on {0, 1}n.
A study of Eulerian numbers by means of an operator on permutations
Authors: Shinji Tanimoto
Venue: European Journal of Combinatorics (2003)

In a previous paper an operator on permutations was defined and its application was discussed. The operator preserves the numbers of their ascents, and each permutation has its own period and orbit under the operator, by which it enables us to study Eulerian numbers. The objective of this paper is to investigate the numbers of orbits and permutations in more detail and to discuss their applications to Eulerian numbers. They include representations of Eulerian numbers by means of orbits and some congruence relations modulo prime powers.
Security of the most significant bits of the Shamir message passing scheme
Authors: Maria Isabel González Vasco, Igor E. Shparlinski
Venue: Mathematics of Computation (2002)

Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element α of a finite field Fp of p elements from rather short strings of the most significant bits of the remainder modulo p of αt for several values of t selected uniformly at random from Fp*. Unfortunately the applications to the computational security of most significant bits of private keys of some finite field exponentiation based cryptosystems given by Boneh and Venkatesan are not quite correct. For the Diffie-Hellman cryptosystem the result of Boneh and Venkatesan has been corrected and generalized in our recent paper. Here a similar analysis is given for the Shamir message passing scheme. The results depend on some bounds of exponential sums.