ppxscal/embedding_network huggingface dataset:
Supporting timeliness and accuracy in distributed real-time content-based video analysis
Authors: Viktor S. Wold Eide, Frank Eliassen, Ole-Christoffer Granmo, Olav Lysne
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Real-time content-based access to live video data requires content analysis applications that are able to process the video data at least as fast as the video data is made available to the application and with an acceptable error rate. Statements as this express quality of service (QoS) requirements to the application. In order to provide some level of control of the QoS provided, the video content analysis application must be scalable and resource aware so that requirements of timeliness and accuracy can be met by allocating additional processing resources.In this paper we present a general architecture of video content analysis applications including a model for specifying requirements of timeliness and accuracy. The salient features of the architecture include its combination of probabilistic knowledge-based media content analysis with QoS and distributed resource management to handle QoS requirements, and its independent scalability at multiple logical levels of distribution. We also present experimental results with an algorithm for QoS-aware selection of configurations of feature extractor and classification algorithms that can be used to balance requirements of timeliness and accuracy against available processing resources. Experiments with an implementation of a real-time motion vector based object-tracking application, demonstrate the scalability of the architecture.
Preconditions for understanding
Authors: David Garlan
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

We argue that advocates of a formal method have an obligation to explain the relationship between the role of proof in that method and the role of proof in others. Such comparisons are needed to (a) clarify the "method" behind a specific notation, (b) dispel misconceptions invited by the use of similar vocabulary with different meanings, and (c) suggest improvements to existing methods. We illustrate these points by comparing the use of preconditions in Z with that in other formal methods.
Cycling in linear programming problems
Authors: Saul I. Gass, Sasirekha Vinjamuri
Venue: Computers and Operations Research (2004)

We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these problems, we were interested in whether or not some of the more popular linear programming solvers would find an optimal solution. This technical note reviews the results of our analysis and some related topics on cycling.
Human brain and neural network behavior: a comparison
Authors: John Peter Jesan, Donald M. Lauro
Venue: Ubiquity (2003)

On the matter of memory, there is no comparision. Neural networks are potentially faster and more accurate than humans.
A Helix-Spindle model for ontological engineering
Authors: Rajiv Kishore, Hong Zhang, R. Ramesh
Venue: Communications of the ACM (2004)

Using a forward-lockstep build-test process that combines theoretic and pragmatic approaches to ontology building.
Applying GMDH algorithm to extract rules from examples
Authors: Koji Fujimoto, Sampei Nakabayashi
Venue: Systems Analysis Modelling Simulation (2003)

This article reports a new approach to rule extraction method by using Group Method of Data Handling (GMDH) Algorithm in Data Mining area. The advantages of this method are (1) it accepts both categorical and continuous data at the same time, and (2) rules can be extracted easily from the generated model.We applied GMDH Algorithm to categorical data set of US congress voting records to extract rules. The correction rate of GMDH rules was 97.3% -- higher than Tsukimoto's method of rule extraction from Back-propagation neural network (81.0%). It was also higher than 97.0% of C4.5.
A Methodology for Devising Optimal All-port All-to-all Broadcast Algorithms in 2-Dimensional Tori
Authors: Jean-Pierre Jung, Ibrahima Sakho
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

All-to-all broadcast is a collective communicationin a network with the constraint that every node mustsend to each other certain piece of its data. This paperreports a methodology to devise all-port efficientalgorithms for such communication inmultidimensional tori. Efficiency criteria beingminimum steps of no duplicated data exchange whilebalancing the communication links-load. Resultingalgorithms are message combining algorithms. Tocomplete an all-to-all broadcast these algorithmsrequire the number of data exchange steps in terms oflink hops to be equal to the diameter of theinterconnection network The number of dataexchanged at each step varies as a gaussian curvewhose maximum equals the half of the networkdiameter per link.
Dynamic Power Optimization of Interactive Systems
Authors: Lin Zhong, Niraj K. Jha
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Abstract| Power has become a major concern for mobile computing systems such as laptops and handhelds, onwhich a significant fraction of software usage is interactiveinstead of computation-intensive. An analysis shows thatover 90% of system energy and time is spent waiting foruser input. Such idle periods provide vast opportunitiesfor dynamic power management (DPM) and voltage scaling(DVS) techniques to reduce system energy. The user interface is in charge of system-user interaction. It often has apriori knowledge about how the user and system interact ata given moment. In this work, we propose to utilize such apriori knowledge and theories from the field of Psychologyto predict user delays. We show that such delay predictionscan be combined with DPM/DVS for aggressive power optimization. We verify the effectiveness of our methodologiesusing usage traces collected on a personal digital assistant(PDA) and a system power model based on accurate measurements. Experiments show that using predicted user delays for DPM/DVS achieves an average of 21.9% systemenergy reduction with little sacrifice in user productivity orsatisfaction.
Comparison of adaptive body bias (ABB) and adaptive supply voltage (ASV) for improving delay and leakage under the presence of process variation
Authors: Tom Chen, Samuel Naffziger
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

Process variations as a percentage of nominal delay and power consumption are becoming more and more severe with continuing scaling of VLSI technology. The worsening process variation causes increased variability in performance, power, and reliability of VLSI circuits. Thus, performance and power consumption targets obtained during the design phase of VLSI circuits may significantly deviate from that of actual silicon resulting in significant yield losses. Adaptive body bias (ABB) has been shown to be an effective method of postsilicon tuning to reduce variability under the presence of process variation. Post silicon tuning can also be accomplished by using adaptive supply voltage (ASV). This paper compares the effectiveness of ABB and ASV in reducing variability and improving performance and power, and thus, yield.
Replicating Web Structure in Small-Scale Test Collections
Authors: Cathal Gurrin, Alan F. Smeaton
Venue: Information Retrieval (2004)

Linkage analysis as an aid to web search has been assumed to be of significant benefit and we know that it is being implemented by many major Search Engines. Why then have few TREC participants been able to scientifically prove the benefits of linkage analysis in recent years? In this paper we put forward reasons why many disappointing results have been found in TREC experiments and we identify the linkage density requirements of a dataset to faithfully support experiments into linkage-based retrieval by examining the linkage structure of the WWW. Based on these requirements we report on methodologies for synthesising such a test collection.
A 27 mW 1.1 mm2 Motion Estimator for Picture-Rate Up-converter
Authors: Aleksandar Beric, Ramanathan Sethuraman, Harm Peters, Jef van Meerbergen, Gerard de Haan, Carlos Alba Pinto
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

The gap between application-specific integrated circuits(ASICs) and general purpose programmable processors interms of performance, power, cost and flexibility is wellknown.Application specific instruction set processors(ASIPs) bridge this wide gap.This work presents a design ofa very long instruction word (VLIW) based ASIP for motionestimation which is used in the picture-rate up-conversionapplication.The ASIP meets low-power and low-cost requirementsapart from providing flexibility for the applicationdomain.It consumes 27 mW and takes an area of 1.1 mm2in 0.13 µm technology for delivery motion estimationfunctionality for standard definition (SD) sequences at140fps.Motion estimator performed single scan, where foreach block of 8*8 pixels evaluation is done using the setof five motion vector candidates.The evaluation criterionwas the sum-of-absolute-difference (SAD) criterion with theSAD window size of 32 pixels.In order to prove the conceptin silicon, an FPGA prototyping system has been used.
Management of security in TCP/IP hosts using dedicated monitoring applications
Authors: Rui Costa Cardoso, Mário M. Freire
Venue: Network control and engineering for Qos, security and mobility II (2003)

In this paper, we present an approach for detection of vulnerabilities in network systems, using autonomous applications. The main aim is to enable the dynamic, intelligent and autonomous detection of vulnerabilities and exposures in systems and to make it available to network administrators. Our approach will reduce the amount of data sent to network administrators by currently used tools, and therefore present only relevant information preprocessed by our application, which by it self can bring a natural enhancement to the performance of the network overall security.
Panel: getting the word out: how to publish in the 3D world
Authors: Adam Watkins, Jenifer Niles, Jim Hill, Jim Thacker
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

Universities, colleges and high schools are often rich areas for technique development, technology progression, and the opportunity for dynamic advanced in learning 3D concepts. Unfortunately, often all of these great advances go unnoticed locally, nationally and internationally even though dissemination of research is an important part of most college and university professors' job descriptions and career development.The exposure publication provides for a professor, a department or a university is hard to over-rate. Exposure helps the professor's career and brings attention to the department and opportunities for the department's students. A publishing professor brings benefits to everyone from the University he teaches at to the students who attend the institution.But despite all the benefits known to educators, finding venues for distribution of new ideas or techniques can be a daunting task. Who wants the ideas? Are trade magazines interested in teaching techniques? Do the ideas warrant an article, a series of articles, or a book? Even more intimidating is the prospect of trying to package the ideas in a way that is attractive to publishers. Do I write the article or book and then submit it to potential publishers or do I send just the idea? Or does the solution exist somewhere in between?Ironically, publishers (those with the power to distribute the ideas that are so carefully developed in academia) are always on the lookout for new ideas, new techniques, and writers who can articulate them. They are aggressively looking for the same kind of ideas that their readership eagerly awaits. Good articles and good books mean good sales and good distribution. They want to publish educator's work.So if educators want to publish and publishers want to publish educator's work, why is there such a disconnect?There needn't be. This panel would be the means of bringing together those with the ideas together with the publishers and editors who are hungry for them. The panel consists of two book publishers who publish books for the beginning to advanced 3D market. Many of their books are used as textbooks throughout the country. Additionally, the panel also has the Editor in Chief of one of the top international 3D trade magazines.These panelists can provide details on what they are looking for in proposals. They will expound on desired focus, scope, and what the details of proposals should be. Additionally, the panel will give words of wisdom on "who to send what to whom"
The role of use cases in the UML: a review and research agenda
Authors: Brian Dobing, Jeffrey Parsons
Venue: Advanced topics in database research vol. 1 (2003)

A use case is a description of a sequence of actions constituting a complete task or transaction in an application. Use cases were first proposed by Jacobson (1987) and have since been incorporated as one of the key modeling constructs in the UML(Booch, Jacobson, & Rumbaugh, 1999) and the Unified Software Development Process(Jacobson, Booch, & Rumbaugh, 1999). This chapter traces the development of use cases, and identifies a number of problems with both their application and theoretical underpinnings. From an application perspective, the use-case concept is marked by a high degree of variety in the level of abstraction versus implementation detail advocated by various authors. In addition, use cases are promoted as a primary mechanism for identifying objects in an application, even though they focus on processes rather than objects. Moreover, there is an apparent inconsistency between the so-called naturalness of object models and the commonly held view that use cases should be the primary means of communicating and verifying requirements with users. From a theoretical standpoint, the introduction of implementation issues in use cases can be seen as prematurely anchoring the analysis to particular implementation decisions. In addition, the fragmentation of objects across use cases creates conceptual difficulties in developing a comprehensive class diagram from a set of use cases. Moreover, the role of categorization in human thinking suggests that class diagrams may serve directly as a good mechanism for communicating and verifying application requirements with users. We conclude by outlining a framework for further empirical research to resolve issues raised in our analysis.
Mask and format: operators for editing and formatting
Authors: D. R. Ditzel, P. C. Hutchison
Venue: ACM SIGPLAN Notices (1977)

String-processing and editing operators have been notably absent from most high-level general-purpose programming languages. With the exception of the "substring" function, all formating of character strings and numbers has been done via I/O statements. In order to use the editing capabilities of these statements internally, language designers have resorted to such awkard techniques as "core to core I/O" in Fortran, or PUT STRING in PL/I. Two operators currently used with the SYMBOL-2R computer system eliminate this difficulty and provide an excellent method of editing and formatting both numbers and character strings.
Fine-Grained Dynamic Voltage and Frequency Scaling for Precise Energy and Performance Trade-Off Based on the Ratio of Off-Chip Access to On-Chip Computation Times
Authors: Kihwan Choi, Ramakrishna Soma, Massoud Pedram
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents an intra-process dynamic voltage and frequency scaling (DVFS) technique targeted toward non real-time applications running on an embedded system platform. The key idea is to make use of runtime information about the external memory access statistics in order to perform CPU voltage and frequency scaling with the goal of minimizing the energy consumption while translucently controlling the performance penalty. The proposed DVFS technique relies on dynamically-constructed regression models that allow the CPU to calculate the expected workload and slack time for the next time slot, and thus, adjust its voltage and frequency in order to save energy while meeting soft timing constraints. This is in turn achieved by estimating and exploiting the ratio of the total off-chip access time to the total on-chip computation time. The proposed technique has been implemented on an XScale-based embedded system platform and actual energy savings have been calculated by current measurements in hardware. For memory-bound programs, a CPU energy saving of more than 70% with a performance degradation of 12% was achieved. For CPU-bound programs, 15-60% CPU energy saving was achieved at the cost of 5-20% performance penalty.
Leafing digital content
Authors: A. Barletta, M. Mayer, B. Moser
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

Today the availability of large digital content archives (video, ebook, audio) creates many problems in terms of user interaction and data manipulation (browsing, searching). Many approaches have been introduced in the past for quickly browsing a digital video library. In this paper we introduce a general framework for representing multimedia contents with a more effective, user-driven, speed-dependent browsing process by using a different user interaction metaphor: the manual/mental process of "leafing through the pages of an illustrated magazine". "Digital Leafing" is a combination of user interactions and speed-dependent data representation of digital contents. In case of video, we conclude that such a solution provides a more neutral and personal browsing and it trades off the complexity of video extraction algorithms with a higher user control.
Using the Incremental Approach to Generate Test Sets: A Case Study
Authors: Y. T. Yu, M. F. Lau, T. Y. Chen
Venue: Proceedings of the Third International Conference on Quality Software (2003)

With the increasing complexity of software systems,the set of testing requirements can become very large.If the set of testing requirements can be naturallydecomposed into smaller subsets, one may constructa test set separately to satisfy each subset of testingrequirements, and then combine the test sets to form thecomplete test set. Such an approach is referred to asthe union approach. On the other hand, the incrementalapproach attempts to incrementally expand a test setto satisfy the subsets of testing requirements, one ata time. This paper investigates empirically the effectof the incremental approach as compared to the unionapproach. Our case study indicates that the incrementalapproach can result in a significantly smaller test set,particularly when supplemented with the greedy heuristics.
Truncation Error Analysis of Multipole Expansion
Authors: Shinichiro Ohnuki, Weng Cho Chew
Venue: SIAM Journal on Scientific Computing (2003)

The multilevel fast multipole algorithm is based on the multipole expansion, which has numerical error sources such as truncation of the addition theorem, numerical integration, and interpolation/anterpolation. Of these, we focus on the truncation error and discuss its control precisely. The conventional selection rule fails when the buffer size is small compared to the desired numerical accuracy. We propose a new approach and show that the truncation error can be controlled and predicted regardless of the number of buffer sizes.
Motion-compensated wavelet packet zerotree video coding on multicomputers
Authors: Manfred Feil, Andreas Uhl
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

In this work we describe and analyze algorithms for advanced video coding on distributed memory MIMD architectures. In particular, we consider a wavelet packet based codec using the concept of zerotree encoding. The main contribution of this work is the design of a parallel motion-compensated video coder composed of a wavelet packet decomposition in conjunction with the best basis algorithm followed by zerotree coding. Whereas two sensible parallelization techniques can be employed for the wavelet packet decomposition (subband based partitioning and stripe partitioning), the zerotree coding and motion compensation stages only allow one reasonable parallelization method (stripe partitioning). We investigate the advantages and drawbacks of the resulting different overall data distribution strategies and show experimental results obtained on a Siemens hpcLine cluster and a Cray T3E.
Algorithm Recognition based on Demand-Driven Data-flow Analysis
Authors: Christophe Alias, Denis Barthou
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Algorithm recognition is an important problem in programanalysis, optimization, and more particularly programcomprehension. Basically, one would like to submita piece of code, and get an answer like "Lines 10 to 23 arean implementation of Gauss-Jordan elimination". Existingapproaches often perform a bottom-up recognition, using adatabase describing many implementation variations of agiven algorithm, in a format making them difficult to maintain.In this paper, we present a new method to recognize algorithmtemplates in a program. We perform a top-downrecognition, stopping at template variables and thus limitingthe need for many program variations. The code toanalyze is given in SSA form, and the \phi-functions are computedon-demand, when computation is possible, along thecandidate slices.
Limit Laws for the Optimal Directed Tree with Random Costs
Authors: Jennie C. Hansen
Venue: Combinatorics, Probability and Computing (1997)

Suppose that &Cscr;={cij&ratio;i, j&ge;1} is a collection of i.i.d. nonnegative continuous random variables and suppose T is a rooted, directed tree on vertices labelled 1,2,...,n. Then the &lsquo;cost&rsquo; of T is defined to be c(T)=&sum; (i,j)&isin;Tcij, where (i, j) denotes the directed edge from i to j in the tree T. Let Tn denote the &lsquo;optimal&rsquo; tree, i.e. c(Tn) =min{c(T)&ratio;T is a directed, rooted tree in with n vertices}. We establish general conditions on the asymptotic behaviour of the moments of the order statistics of the variables c11, c12, ..., cin which guarantee the existence of sequences {an}, {bn}, and {dn} such that b&minus;1n (c(Tn)&minus;an) &rarr;N(0, 1) in distribution, d&minus;1n c(Tn)&rarr;1 in probability, and d&minus;1n E(c(Tn))&rarr;1 as n&rarr;&infin;, and we explicitly determine these sequences. The proofs of the main results rely upon the properties of general random mappings of the set {1, 2, ..., n} into itself. Our results complement and extend those obtained by McDiarmid [9] for optimal branchings in a complete directed graph.
Product Design with Multiple Quality-Type Attributes
Authors: Kilsun Kim, Dilip Chhajed
Venue: Management Science (2002)

We consider a product line design problem withmultiple attributes for a monopolist serving a market with two customer segments. Products are designed with quality type attributes for which more is always better than less. By considering multiple attributes, we derive a measure of multidimensional customer preference and offer insights into the optimal product design. When customers' preferences exhibit different orders in different attributes, our results show that products are differentiated horizontally where no one product is better than the other with respect to all attributes, and that there exists a region where the first-best solution for the monopolist is feasible despite the problem of cannibalization. Furthermore, single-product offering strategies are never optimal, so pooling of customer segments or reduction of the number of segments served will not occur.