ppxscal/embedding_network huggingface dataset:
Is random model better? On its accuracy and efficiency
Authors: Wei Fan, Haixun Wang, Philip S. Yu, Sheng Ma
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Inductive learning searches an optimal hypothesis thatminimizes a given loss function. It is usually assumed thatthe simplest hypothesis that fits the data is the best approximateto an optimal hypothesis. Since finding the simplesthypothesis is NP-hard for most representations, we generallyemploy various heuristics to search its closest match.Computing these heuristics incurs significant cost, makinglearning inefficient and unscalable for large dataset. In thesame time, it is still questionable if the simplest hypothesisis indeed the closest approximate to the optimal model.Recent success of combining multiple models, such as bagging,boosting and meta-learning, has greatly improved theaccuracy of the simplest hypothesis, providing a strong argumentagainst the optimality of the simplest hypothesis.However, computing these combined hypotheses incurs significantlyhigher cost. In this paper, we first advert that aslong as the error of a hypothesis on each example is withina range dictated by a given loss function, it can still be optimal.Contrary to common beliefs, we propose a completelyrandom decision tree algorithm that achieves much higheraccuracy than the single best hypothesis and is comparableto boosted or bagged multiple best hypotheses. The advantageof multiple random tree is its training efficiency aswell as minimal memory requirement.
Inductive benchmarking for purely functional data structures
Authors: Graeme E. Moss, Colin Runciman
Venue: Journal of Functional Programming (2001)

Every designer of a new data structure wants to know how well it performs in comparison with others. But finding, coding and testing applications as benchmarks can be tedious and time-consuming. Besides, how a benchmark uses a data structure may considerably affect its apparent efficiency, so the choice of applications may bias the results. We address these problems by developing a tool for inductive benchmarking. This tool, Auburn, can generate benchmarks across a wide distribution of uses. We precisely define &lsquo;the use of a data structure&rsquo;, upon which we build the core algorithms of Auburn: how to generate a benchmark from a description of use, and how to extract a description of use from an application. We then apply inductive classification techniques to obtain decision trees for the choice between competing data structures. We test Auburn by benchmarking several implementations of three common data structures: queues, random-access lists and heaps. These and other results show Auburn to be a useful and accurate tool, but they also reveal some limitations of the approach.
Breaking the rules: success and failure in groupware-supported business process reengineering
Authors: Alan R. Dennis, Traci A. Carte, Gigi G. Kelly
Venue: Decision Support Systems (2003)

In the information economy, businesses are changing more often and more rapidly than ever before. The lessons learned from a decade of business process reengineering (BPR) research may provide insights to researchers and managers trying to understand and successfully navigate these changes. This paper examines the successes and failures of groupware-supported BPR processes in four organizations. Two were successful and two were failures. Groupware allowed certain tasks to be performed faster, added structure to the BPR process and facilitated participation by more people. The key difference between the successful and the unsuccessful cases was when and how senior management was involved.
An efficient R-tree implementation over flash-memory storage systems
Authors: Chin-Hsien Wu, Li-Pin Chang, Tei-Wei Kuo
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

For many applications with spatial data management such as Geographic Information Systems (GIS), block-oriented access over flash memory could introduce a significant number of node updates. Such node updates could result in a large number of out-place updates and garbage collection over flash memory and damage its reliability. In this paper, we propose a very different approach which could efficiently handle fine-grained updates due to R-tree index access of spatial data over flash memory. The implementation is done directly over the flash translation layer (FTL) without any modifications to existing application systems. The feasibility of the proposed methodology is demonstrated with significant improvement on system performance, overheads on flash-memory management, and energy dissipation.
ACM Queue
Authors: Edward Grossman
Venue: Computers in Entertainment (CIE) (2003)

I am the Editor of Queue (http://www.acmqueue.org), ACM's recently launched magazine geared towards practicing software developers and architects. We have a great editorial advisory board, including industry giants such as Steve Bourne, Eric Allman, and Jim Gray.We have a special report on "Gaming Technology and Issues" coming up. We are looking for people who might be interested in writing for this issue.We would be entirely open on article ideas for this or upcoming issues. Queue is not a "here's the latest product from company X" magazine -- we are more in-depth, focusing on core technologies themselves, how they affect software developers. Obviously gaming is an area that has a huge impact far beyond just the gaming industry. We want to share what is happening at the cutting edge with our audience.
Linking multimedia presentations with their symbolic source documents: algorithm and applications
Authors: Berna Erol, Jonathan J. Hull, Dar-Shyang Lee
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

An algorithm is presented that automatically matches images of presentation slides to the symbolic source file (e.g., PowerPoint™ or Acrobat™) from which they were generated. The images are captured either by tapping the video output from a laptop connected to a projector or by taking a picture of what's displayed on the screen in a conference room. The matching algorithm extracts features from the image data, including OCR output, edges, projection profiles, and layout and determines the symbolic file that contains the most similar collection of features. This algorithm enables several unique applications for enhancing a meeting in real-time and accessing the audio and video that were recorded while a presentation was being given. These applications include the simultaneous translation of presentation slides during a meeting, linking video clips inside a PowerPoint file that show how each slide was described by the presenter, and retrieving presentation recordings using digital camera images as queries.
Dynamically Parameterized Algorithms and Architectures to Exploit Signal Variations
Authors: Prashant Jain, Andrew Laffely, Wayne Burleson, Russell Tessier, Dennis Goeckel
Venue: Journal of VLSI Signal Processing Systems (2004)

Signal processing algorithms and architectures can use dynamic reconfiguration to exploit variations in signal statistics with the objectives of improved performance and reduced power. Parameters provide a simple and formal way to characterize incremental changes to a computation and its computing mechanism. This paper develops a framework for dynamic parameterization and applies it to MPEG-4 motion estimation. A novel motion estimation architecture facilitates the dynamic variation of parameters to achieve power-compression tradeoffs. Our work shows that parameter variation in motion estimation helps achieve power reduction by an order of magnitude, trading off higher compression for lower power. The magnitude of the tradeoffs depends on the input signal variation. The monitoring of input and output signal statistics and subsequent variation of parameters is accomplished by a hardware controller. To provide the controller with a model of the parameter space and corresponding measures in terms of power and performance, a configuration sample space graph is developed. This graph identifies the parameters which present the best power-performance tradeoffs. The controller samples the operating environment to select the appropriate parameters. This reduces the average power consumption by 40% for 2% loss in compression. Four other signal dependent computations: (1) 2D Discrete Cosine Transform, (2) Lempel-Ziv lossless compression, (3) 3D graphics light rendering, and (4) Viterbi decoding are briefly discussed to demonstrate the applicability of dynamic reconfiguration.
Assessing the role and conduct of online collaborative projects in e-learning
Authors: Willa Earline Pickering
Venue:  (2003)

This dissertation describes research on the collaborative behaviors of study groups in graduate E-Learning classes in computer systems management and information technology. Research on collaborative behaviors in an online environment has been limited. At the same time, industry is increasingly using geographically dispersed teams who communicate via intranets or extranets to develop information technology systems. Online collaborative behaviors differ from face-to-face interactions in that they are text-based and lack facial expressions and body language. Thus, the pedagogical methods for teaching collaboration in E-Learning and how they differ from the methods that have been successful in face-to-face classes need to be better understood. Classes at the University of Maryland University College were observed to analyze how students produce work collaboratively in a networked environment. Twelve online classes were observed over a full semester to assess the role and conduct of collaborative study groups. To assess the role, final grades for students participating in a study group were compared to the final grades of students who did not participate in a study group. To assess the conduct of collaborative study groups, interactive messages among study group members were categorized according to collaborative behaviors documented in the literature. Over four thousand interactive messages among members of 56 online collaborative study groups were collected and categorized. The numbers of interactions per collaborative behavior were statistically analyzed using standard exploratory data analyses, nonparametric correlation tests, and linear regression methods to evaluate the relationship of the behaviors to the project grade. Online collaborative behaviors relating to teamwork, work production, and organization of work were found to be highly correlated. The analyses indicate that all of these behaviors are significantly related to the project grade with behaviors related to work production being the most important predictor of project grade.
Self-Organizing Approach for Automated Gene Identification
Authors: Audrey Yu. Zinovyev, Alexander N. Gorban, Tatyana G. Popova
Venue: Open Systems Information Dynamics (2003)

Self-training technique for automated gene recognition both in entire genomes and in unassembled ones is proposed. It is based on a simple measure (namely, the vector of frequencies of non-overlapping triplets in sliding window), and needs neither predetermined information, nor preliminary learning. The sliding window length is the only one tuning parameter. It should be chosen close to the average exon length typical to the DNA text under investigation. An essential feature of the technique proposed is preliminary visualization of the set of vectors in the subspace of the first three principal components. It was shown, the distribution of DNA sites has the bullet-like structure with one central cluster (corresponding to non-coding sites) and three or six flank ones (corresponding to protein-coding sites). The bullet-like structure itself revealed in the distribution seems to be very interesting illustration of triplet usage in DNA sequence. The method was examined on several genomes (mitochondrion of P.wickerhamii, bacteria C.crescentus and primitive eukaryot S.cerevisiae). The percentage of truly predicted nucleotides exceeds 90%.
Sharing the Wealth: When Should Firms Treat Customers as Partners?
Authors: Eric T. Anderson
Venue: Management Science (2002)

Marketers often stress the importance of treating customers as partners. A fundamental premise of this perspective is that all parties can be weakly better off if they work together to increase joint surplus and reach Pareto-efficient agreements. For marketing managers, this implies organizing marketing activities in a manner that maximizes total surplus. This logic is theoretically sound when agreements between partners are limitless and costless. In most consumer marketing contexts (business-to-consumer), this is typically not true. The question I ask is should one still expect firms to partner with consumers and reach Pareto-efficient agreements? In this paper, I use the example of a firm's choice of product configuration to demonstrate two effects. First, I show that a firm may configure a product in a manner that reduces total surplus but increases firm profits. Second, one might conjecture that increased competition would eliminate this effect, but I show that in a duopoly firm profits may be increasing in the cost of product completion. This second result suggests that firms may prefer to remain inefficient and/or stifie innovations. Both results violate a fundamental premise of partnering--that firms and consumers should work together to increase total surplus and reach Pareto-efficient agreements. The model illustrates that Pareto-efficient agreements are less likely to occur if negotiation with individual partners is infeasible or costly, such as in business-to--consumer contexts. Consumer marketers in one-to- many marketing environments should be wary of treating customers as partners because Pareto--efficient agreements may not be optimal for their firm.
Simple relational correctness proofs for static analyses and program transformations
Authors: Nick Benton
Venue: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2004)

We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logical and denotationaltechniques. The key ingredients are an interpretation of program properties as relations, rather than predicates, and a realization that although many program analyses are traditionally formulated in very intensional terms, the associated transformations are actually enabled by more liberal extensional properties.We illustrate our approach with formal systems for analysing and transforming while-programs. The first is a simple type system which tracks constancy and dependency information and can be used to perform dead-code elimination, constant propagation and program slicing as well as capturing a form of secure information flow. The second is a relational version of Hoare logic, which significantly generalizes our first type system and can also justify optimizations including hoisting loop invariants. Finally we show how a simple available expression analysis and redundancy elimination transformation may be justified by translation into relational Hoare logic.
Increase in Computing Capability and its Influence on Service Provision
Authors: Adekunle Okunoye
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Applications of information technology (IT) have in no doubt had significant impact in every stage of service provision, production, delivery, receipt and quality. Today, the greatly increased use of IT by service providers has in many ways changed the nature of service delivery. The dynamism and rapid changes in IT which progress from traditional businesscomputing to mobile and pervasive computing and which is now tending towards ubiquitous computing have posed serious challenges to service globally. Service in the industrial era was well understood. It was considered distinct to product and limited by geographical locations and technological constraints. However, as we are entering the knowledge era, where knowledge has become the main competitive advantage, the distinction between services and products are blurring with increase application of information technology, and there seems to be no limit to what could be achieved with technology. Dynamism in the production of information technology also requires corresponding dynamism in its applications to the service provision. However, there is lack of adequate attention to these issues in information systems research and practice. There is little understanding of how the rapid changes and developments in IT could affect service provision. Using the four characteristics of service - intangibility, inseparability (of production and consumption), perishability and heterogeneity, this paper examines service provision, the current trends in ubiquitous computing and the possible changes it could have on service provision.
Introducing alpha shapes for the analysis of path integral Monte Carlo results
Authors: Patrick J. Moran, Marcus Wagner
Venue: Proceedings of the conference on Visualization '94 (1994)

We present a new technique for the visualization and analysis of the results from Monte Carlo simulations based on &alpha;-complexes and &alpha;-shapes. The specific application we present in this article is the analysis of the quantum-mechanical behavior of hydrogen molecules and helium atoms on a surface at very low temperatures. Our technique is an improvement over existing techniques in two respects. First, our approach allows one to visualize the points on a random walk at varying levels of detail and interactively select the level of detail that is most appropriate. Second using &alpha;-shapes one can obtain quantitative measures of spatial properties of the system, such as the boundary length and interior area of clusters, that would be difficult to obtain otherwise.
Optimization of tunneling magnetotransport and thermal properties in magnetic tunnel junctions by rapid thermal anneal
Authors: K. I. Lee, K. H. Chae, J. H. Lee, J. G. Ha, K. Rhie, W. Y. Lee, K. H. Shin
Venue: Microelectronic Engineering (2003)

We report on a systematic investigation of rapid thermal anneal (RTA) effects on the properties of FeMn exchange-biased magnetic tunnel junctions (MTJs). The tunneling magnetoresistance (TMR) in an as-grown MTJ is found to be ∼27%, whereas the TMR in MTJs annealed by RTA increases with annealing temperature up to 300°C, reaching ∼46%. A significant change in the effective barrier thickness (teff) and height (Φeff) occurs within 10 s during RTA. Transmission electron microscopy and X-ray reflectivity studies demonstrate that the interface of the alumina tunnel barrier for the MTJ annealed by RTA became sharper and clearer, giving rise to the enhanced TMR.
Online Handwritten Script Recognition
Authors: Anoop M. Namboodiri, Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--Automatic identification of handwritten script facilitates many important applications such as automatic transcription of multilingual documents and search for documents on the Web containing a particular script. The increase in usage of handheld devices which accept handwritten input has created a growing demand for algorithms that can efficiently analyze and retrieve handwritten data. This paper proposes a method to classify words and lines in an online handwritten document into one of the six major scripts: Arabic, Cyrillic, Devnagari, Han, Hebrew, or Roman. The classification is based on 11 different spatial and temporal features extracted from the strokes of the words. The proposed system attains an overall classification accuracy of 87.1 percent at the word level with 5-fold cross validation on a data set containing 13,379 words. The classification accuracy improves to 95 percent as the number of words in the test sample is increased to five, and to 95.5 percent for complete text lines consisting of an average of seven words.
An IP Traceback Technique against Denial-of-Service Attacks
Authors: Zhaole Chen, Moon-Chuen Lee
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

Reflector attack [9] belongs to one of the most serioustypes of Denial-of-Service (DoS) attacks, which canhardly be traced by contemporary traceback techniques,since the marked information written by any routersbetween the attacker and the reflectors will be lost in thereplied packets from the reflectors. We propose in thispaper a reflective algebraic marking scheme for tracingDoS and DDoS attacks, as well as reflector attacks. Theproposed marking scheme contains three algorithms,namely the marking, reflection and reconstructionalgorithms, which have been well tested through extensivesimulation experiments. The results show that the markingscheme can achieve a high performance in tracing thesources of the potential attack packets. In addition, itproduces negligible false positives; whereas other currentmethods usually produce a certain amount of falsepositives.
Designing Leakage Aware Multipliers
Authors: M. DeRenzo, M. J. Irwin, N. Vijaykrishnan
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Power consumption has become a major design limiter. With the continued reduction of threshold voltages, optimizing leakage energy consumption is becoming increasingly important. Hence, the design of leakage-conscious memory and data path components is vital. This paper focuses on designing a 32-bit double precision multiplier, and shows how the appropriate choice of implementation primitives used in the design can provide significant leakage energy savings without much impact on performance.
A VLSI floorplanner based on "balloon" expansion
Authors: Noritake Yonezawa, Nobuyuki Nishiguchi, Atsushi Etani, Fumiaki Tsukuda, Ryuichi Hashishita
Venue: Proceedings of the conference on European design automation (1990)

A novel floorplanning method is presented that models blocks as rectangular "balloon"s, which are gradually expanded to determine their shapes and placement. Unlike the existing approaches, which assume the floorplan to be a slicing structure or which never handle fixed-shaped blocks, this method can handle fixed-shaped blocks as well as variable-shaped blocks on a general (non-slicing) layout structure. Experimetal results show that the proposed method works effectively and gives an accurate estimate of chip area with only 3 to 6 percent difference from final layout, especially when the fixed- and variable-shaped blocks are mixed.
Web unit mining: finding and classifying subgraphs of web pages
Authors: Aixin Sun, Ee-Peng Lim
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

In web classification, most researchers assume that the objects to classify are individual web pages from one or more web sites. In practice, the assumption is too restrictive since a web page itself may not always correspond to a concept instance of some semantic concept (or category) given to the classification task. In this paper, we want to relax this assumption and allow a concept instance to be represented by a subgraph of web pages or a set of web pages. We identify several new issues to be addressed when the assumption is removed, and formulate the web unit mining problem. We also propose an iterative web unit mining (iWUM) method that first finds subgraphs of web pages using some knowledge about web site structure. From these web subgraphs, web units are constructed and classified into semantic concepts (or categories) in an iterative manner. Our experiments using the WebKB dataset showed that iWUM improves the overall classification performance and works very well on the more structured parts of a web site.