ppxscal/embedding_network huggingface dataset:
Summary of evaluation and comments
Authors: Mark Scott Johnson
Venue: ACM SIGPLAN Notices (1983)

On the last day of the Symposium an evaluation form was distributed to all participants. About half responded; their comments are summarized here. Three-quarters of those responding felt the Symposium met their expectations well or very well. Important topics reported as being not discussed or not sufficiently discussed included real-time debugging, practical debugging strategies, implementation issues for production debuggers, human factors, and architectural support for debugging.
Combining routing and traffic data for detection of IP forwarding anomalies
Authors: Matthew Roughan, Tim Griffin, Morley Mao, Albert Greenberg, Brian Freeman
Venue: Proceedings of the joint international conference on Measurement and modeling of computer systems (2004)

IP forwarding anomalies, triggered by equipment failures, implementation bugs, or configuration errors, can significantly disrupt and degrade network service. Robust and reliable detection of such anomalies is essential to rapid problem diagnosis, problem mitigation, and repair. We propose a simple, robust method that integrates routing and traffic data streams to reliably detect forwarding anomalies. The overall method is scalable, automated and self-training. We find this technique effectively identifies forwarding anomalies, while avoiding the high false alarms rate that would otherwise result if either stream were used unilaterally.
An Approach to Neonatal Intensive Care Unit Management Compliant with DICOM Standard
Authors: Pedro Luiz de Paula Filho, Aldo von Wangenheim, Paulo Dellani
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This work describes a developed software technology to support the clinic accompanimentof newborns in a Neonatal Intensive Care Unit (NICU), where it can help the physicians,nurses and pharmacist directly to the treatment of these babies.With the objective to have the format of a EPR (Electronic Patient Record) and to storeinformation of the patients in an international standard (DICOM SR.), was developed a toolthat, effectively, decrease a considerable time in the execution of the tasks of this departmentand minimizes errors in situations of high risk for the newborns. Having a impact, indirectly,in the improvement of the quality of the attendance of the NICU, giving time to the physiciansto the clinical accompaniment.One of the main characteristics of the Cyclops Neonatal Intensive Care Unit is thecalculation of parenteral nutrition, this represents one of the first forms of feeding for theinterned newborn. This project was implanted in the Maternity Carmela Dutra, ofFlorianópolis, and was validated for more than 18 months, having a positive impact.
Isotopic implicit surface meshing
Authors: Jean-Daniel Boissonnat, David Cohen-Steiner, Gert Vegter
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a piecewise linear approximation of it are isotopic. Then, we deduce from this criterion an implicit surface meshing algorithm certifying that the output mesh is isotopic to the actual implicit surface. This is the first algorithm achieving this goal in a provably correct way.
Linear Codes and Character Sums
Authors: Nathan Linial, Alex Samorodnitsky
Venue: Combinatorica (2002)

Let V be an rn-dimensional linear subspace of $$Z^{n}_{2}$$. Suppose the smallest Hamming weight of non-zero vectors in V is d. (In coding-theoretic terminology, V is a linear code of length n, rate r and distance d.) We settle two extremal problems on such spaces.First, we prove a (weak form) of a conjecture by Kalai and Linial and show that the fraction of vectors in V with weight d is exponentially small. Specifically, in the interesting case of a small r, this fraction does not exceed $$2^{{ - \Omega {\left( {\frac{{r^{2} }} {{\log {\left( {1/r} \right)} + 1}}n} \right)}}} $$.We also answer a question of Ben-Or and show that if $$r > \frac{1} {2}$$, then for every k, at most $$C_{r} \cdot \frac{{{\left| V \right|}}} {{{\sqrt n }}}$$ vectors of V have weight k.Our work draws on a simple connection between extremal properties of linear subspaces of $$Z^{n}_{2}$$ and the distribution of values in short sums of $$Z^{n}_{2}$$-characters.
An Algorithmic Approach for Generic Parallel Adders
Authors: Jianhua Liu, Shuo Zhou, Haikun Zhu, Chung-Kuan Cheng
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Binary addition is the most fundamental and frequentlyused operation. A well-designed adder should be fast andsatisfy the application requirements. We propose an algorithmicapproach to generate an irregular parallel-prefix adder, whichhas minimal delay for a given profile of input signals. It cancover different topologies such as ripple-carry, carry-skip andcarry-select adders. Compared with Kogge-Stone and Brent-Kungadders, the results of the proposed approach have thesmallest output delay.
Determinants affecting organizations' intent to adopt e-tailing: a study based on innovation theories
Authors: L. March To
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

Online retailing (e-tailing), which is believed as a major technological innovation has aroused significant attention both in literature and business. Nevertheless, while there are abundant adoption studies from consumer perspectives, few studies provide concrete analysis of organizational views. To study organizations' behavior of the e-tailing adoption, the well-known innovation theories (e.g. [1], [2].) provide a valuable base for investigation. However, the major problematic issue in previous innovation theories is the inconsistent findings across studies. A determinant found significantly to an innovation adoption in one study can be insignificant in another study regarding the same innovation typology. It is suggested that more insights in research design be added to the theories before they are employed.The objective of this study is to provide a critical review in order to summarize and explain those inconsistent finding; and to propose a framework with new theoretical relationships to investigate the determinants affecting firms' intent of "e-tailing" adoption. It is indicated that the past inconsistent findings can be caused by mismatch between specificity and generality within a study; and inattention to some interactive relationships among the identified determinants [3]. With respect to the issues, a theoretical framework is proposed to test the new relationships among the four determinants namely 1) Perceived Characteristics of Innovation (PCI), 2) Characteristic of Environment, 3) Characteristic of Organization and 4) Characteristic of Top Management. Hierarchical Regression Analysis is used to test the model with variables entered into the regression equation by the assigned steps.It is expected that a firm who perceives better of e-tailing i.e. relative advantage and compatibility will have better attitude toward its adoption and have higher adoption intention. Besides these, higher competitive pressure, lower channel pressure, bigger firm size, more available IT infrastructure and innovative top management are expected to positively correlate with the intention. However, the real co-relational strengths of those relationships should be moderated by the firm's attitude toward the adoption. For example, competitive pressure is likely to make a firm more innovative in overall; however, whether a company is really willing to adopt a particular innovation would be affected by its attitude toward that innovation. Positive (negative) attitude can increase (decrease) the intention. This moderating effect, which has not addressed by past innovation theories, can explain the inconsistent findings.Figuring out what determinants affect the adoption of e-tailing among organizations provides significant implications. It is useful for managers to evaluate those internal and external factors of their firms. It helps managers position their firms for the decision of online marketing.
Monoids whose Centralizer is the Least Clone
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

For a monoid M of k-valued unary functions, the centralizer M*is the set of k-valued multi-variable functions whichcommute with every function in M. In this paper we considerthe problem of finding monoids whose centralizer isthe least clone. First we give a sucient condition for Mto have the least clone as its centralizer and show how itcan be applied to some concrete examples of M. Then weuse Zadori¡'s theorem to obtain another condition for M tosatisfy this property.
Automated and Rapid Bacterial Identification Using LC-Mass Spectrometry with a Relational Database Management System
Authors: Samir V. Deshpande, Rabih E. Jabbour, Charles Wick, A. Peter Snyder
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

We have developed an integrated and automated software application for rapid bacterial identification using a relational database management system and liquid chromatography-electrospray-ion trap mass spectrometry (LC-ESI-MS). LC-ESI-MS is used to generate chromatographic profiles of proteins in a bacterial sample along with a software program that automates the data analysis. The software program ProMAPDB automates the data collection, peak identification, spectral purification, mass spectral integration of scans in a peak, and assignment of molecular weights for observed proteins by using a deconvolution algorithm described by Zhang and Marshall. The approach generates a list of biomarker masses along with retention time and relative abundance for all masses obtained by the algorithm. The list of masses is stored in a relational database as a reference library including the sample information such as growth conditions and experimental information. The identification of unknown samples is performed by correlation to the relational database. The bacterial database includes E. coli, Bacillus subtilis, B. thuringiensis, and B. megaterium. The approach has been tested for bacterial discrimination and identification from the mass spectra of mixtures of microorganisms and from mass spectra of organisms at different growth conditions. Experimental factors such as sample preparation, reproducibility, mass range and mass accuracy tolerance are also addressed and evaluated. This approach has the potential for reliable and accurate automated data analysis.
Security and Compliance
Authors: Bruce Schneier
Venue: IEEE Security and Privacy (2004)

Just as I advocate software liability as a way to bring the externalities of insecure software into the software manufacturerýs decision-making process, I see data privacy laws as a way to force organizations to take personal data security protection more seriously.
Matrix-based software test data decompression for systems-on-a-chip
Authors: Kedarnath Balakrishnan, Nur A. Touba
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

This paper describes a new compression/decompression methodology for using an embedded processor to test the other components of a system-on-a-chip (SoC). The deterministic test vectors for each core are compressed using matrix-based operations that significantly reduce the amount of test data that needs to be stored on the tester. The compressed data is transferred from the tester to the processor's on-chip memory. The processor executes a program which decompresses the data and applies it to the scan chains of each core-under-test. The matrix-based operations that are used to decompress the test vectors can be performed very efficiently by the embedded processor thereby allowing the decompression program to be very fast and provide high throughput of the test data to minimize test time. Experimental results demonstrate that the proposed approach provides greater compression than previous methods.
Eat your peas
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

Should you follow your heart, or follow instructions? There are times when people should listen to that little voice inside their head, and there are times when they should listen to the voice of authority. The difficulty lies in distinguishing the two. Copyright held by creator.
Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education
Venue: Annual Joint Conference Integrating Technology into Computer Science Education (2004)

We are delighted to present the proceedings of the 9th Annual Conference on Innovation and Technology in Computer Science Education - ITiCSE-04. It is an honour to host this event in the University of Leeds during the institution's centenary year.ITiCSE is the "European arm" of the ACM SIGCSE activities, and has a history of attracting contributions and delegates from around the globe. 2004 will be no exception: there was a record number of submissions from a record number of countries, making the paper selection more competitive and difficult than ever. The acceptance rate this year was less than 30% - those accepted represent 17 different nations, which we believe is also a record. Additionally, as is customary, the programme includes Working Groups, posters demonstrations and tutorials. We are proud of the programme that has emerged.The Conference will also host 3 European keynote speakers - Professors Cliff, Mander and Stepney - and a range of social and other events. As organizers, we hope our guests will find the range of activities on offer rewarding and entertaining, in the now long ITiCSE tradition. Leeds, which was once at the heart of the Victorian industrial north, has reinvented itself as a social and cultural capital for the 21st century, and we look forward to visitors taking full advantage of all it has to offer.As is obvious, the presentation of a conference of this size is fruit of the work of many people. We record here huge thanks to the Conference Committee and the Local Committee. None of this would have been possible without the able support of ACM, and we also gratefully acknowledge financial support from Microsoft.
Energy - Responsiveness Tradeoffs for Real-Time Systems with Mixed Workload
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

In this paper, we explore the performance tradeoffs for real-timesystems with Dynamic Voltage Scaling (DVS) capability,when the workload includes aperiodic jobs as well as periodictasks. As opposed to the assumptions of early works on Real-TimeDVS or non-power-aware scheduling of hybrid task sets,the settings require the consideration of two often-conflictingobjectives: Improving the responsiveness of aperiodic jobs andreducing the energy consumption. We propose the compositemetric, Energy * Average Response Time, as a performancemeasure in energy-aware scheduling of hybrid task sets. Thenwe develop our framework that integrates Dynamic ReclaimingAlgorithm (DRA) and Total Bandwidth Server (TBS) mechanismin variable-speed settings. In addition to the static algorithm,we propose Basic Reclaiming Scheme (BRS) and MutualReclaiming Scheme (MRS) that enable the re-use of the systemslack arising from early task completions. We also present ourBandwidth Sharing Scheme (BSS) that aggressively exploitsthe bandwidth reserved for TBS to further slow down the periodictasks. We provide an experimental evaluation of ouralgorithms under different workloads and speed settings, andshow that BSS can provide significant performance improvementswhen the actual variability in the workload is high.
Accessor variety criteria for Chinese word extraction
Authors: Haodi Feng, Kang Chen, Xiaotie Deng, Weimin Zheng
Venue: Computational Linguistics (2004)

We are interested in the problem of word extraction from Chinese text collections. We define a word to be a meaningful string composed of several Chinese characters. For example, 'percent', and, 'more and more', are not recognized as traditional Chinese words from the viewpoint of some people. However, in our work, they are words because they are very widely used and have specific meanings. We start with the viewpoint that a word is a distinguished linguistic entity that can be used in many different language environments. We consider the characters that are directly before a string (predecessors) and the characters that are directly after a string (successors) as important factors for determining the independence of the string. We call such characters accessors of the string, consider the number of distinct predecessors and successors of a string in a large corpus (TREC 5 and TREC 6 documents), and use them as the measurement of the context independency of a string from the rest of the sentences in the document. Our experiments confirm our hypothesis and show that this simple rule gives quite good results for Chinese word extraction and is comparable to, and for long words outperforms, other iterative methods.
FFPACK: finite field linear algebra package
Authors: Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many algorithms have been reduced to use matrix multiplication in order to be able to prove an optimal theoretical complexity, this paper shows that those optimal complexity algorithms, such as LSP factorization, rank determinant and inverse computation can also be the most efficient.
A friendly face in robotics: Sony's AIBO entertainment robot as an educational tool
Authors: John D. Decuir, Todd Kozuki, Victor Matsuda, Jon Piazza
Venue: Computers in Entertainment (CIE) (2004)

We have developed a way to encourage schools and other institutions to introduce robotics to very young students in their core curriculum. Many schools are understandably nervous about bringing new technology, especially one perceived to be as complicated as robotics, into their classrooms. Our work involves using Sony's AIBO Entertainment Robot in a non-threatening and attractive way so that children can interact with it using two different approaches: a "storybook" program and a "listener" program.
The continuous non-linear approximation of procedurally defined curves using integral B-splines
Authors: Jun Qu, Radha Sarma
Venue: Engineering with Computers (2004)

This paper outlines an algorithm for the continuous non-linear approximation of procedurally defined curves. Unlike conventional approximation methods using the discrete L_2 form metric with sampling points, this algorithm uses the continuous L_2 form metric based on minimizing the integral of the least square error metric between the original and approximate curves. Expressions for the optimality criteria are derived based on exact B-spline integration. Although numerical integration may be necessary for some complicated curves, the use of numerical integration is minimized by a priori explicit evaluations. Plane or space curves with high curvatures and/or discontinuities can also be handled by means of an adaptive knot placement strategy. It has been found that the proposed scheme is more efficient and accurate compared to currently existing interpolation and approximation methods.
A Weight-based Map Matching Method in Moving Objects Databases
Authors: Huabei Yin, Ouri Wolfson
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

In location management, the trajectory represents themotion of a moving object in 3D space-time, i.e., asequence (x, y, t). Unfortunately, location technologies,cannot guarantee error-freedom. Thus, map matching(a.k.a. snapping ), matching a trajectory to the roads onthe map, is necessary. We introduce a weight-based mapmatching method, and experimentally show that, for theoffline situation, on average, our algorithm can get up to94% correctness depending on the GPS sampling interval.
Data forwarding through in-memory precomputation threads
Authors: Wessam Hassanein, José Fortes, Rudolf Eigenmann
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

In modern architectures, memory access latency is an increasingly performance-limiting factor. To reduce this latency, we propose concepts and implementation of a new technique that uses an in-memory processor to precompute future, critical load addresses and forward the computed values to the main processor. The acronym for this technique is IMPT for In-Memory Precomputation-based forwarding Threads. IMPT combines the advantages of precomputation-based techniques with the low memory access latency of processing-in-memory. To evaluate IMPT, we use a cycle-accurate simulation of an aggressive out-of-order processor with accurate simulation of bus and memory contention. The results show a performance gain of up to 1.47 (1.21 on average) over an aggressive superscalar processor. The average load access latency decreases by up to 55% (32% on average).
Proof of a Conjecture of Bollob&#x00e1;s and Eldridge for Graphs of Maximum Degree Three
Authors: B&#x00e9;la Csaba, Ali Shokoufandeh, Endre Szemer&#x00e9;di
Venue: Combinatorica (2003)

Let G1 and G2 be simple graphs on n vertices. If there are edge-disjoint copies of G1 and G2 in Kn, then we say there is a packing of G1 and G2. A conjecture of Bollob&#x00e1;s and Eldridge [5] asserts that if (&#x0394;(G1)+1) (&#x0394;(G2)+1) &#x2264; n + 1 then there is a packing of G1 and G2. We prove this conjecture when &#x0394;(G1) = 3, for sufficiently large n.
A bi-criterion single-machine scheduling problem with learning considerations
Authors: Wen-Chiung Lee, Chin-Chia Wu, Hua-Jung Sung
Venue: Acta Informatica (2004)

Conventionally, job processing times are assumed to be constant from the first job to be processed until the last job to be completed. However, recent empirical studies in several industries have verified that unit costs decline as firms produce more of a product and gain knowledge or experience. This phenomenon is known as the &#x201c;learning effect.&#x201d; This paper focuses on a bi-criterion single-machine scheduling problem with a learning effect. The objective is to find a sequence that minimizes a linear combination of the total completion time and the maximum tardiness. A branch-and-bound and a heuristic algorithm are proposed to search for optimal and near-optimal solutions, respectively. Computational results are also provided for the problem.
An Embedded Architectural Framework for Interaction Between Automobiles and Consumer Devices
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

The last two and one half decades have seen rapidgrowth in the amount and importance of software inautomobiles. This growth is bringing about a shift fromtreating software as a part of the hardware it controlsto viewing it as an implementation of a set of servicesthat mediate between the hardware and thefunctionality seen by the user. This paper describes anin-vehicle computing platform based on the softwareservice platform to provide entertainment andinformation functions that has been implemented in twoprototype vehicles at Ford Motor Company.