ppxscal/embedding_network huggingface dataset:
Performance evaluation of UDP lite for cellular video
Authors: Amoolya Singh, Almudena Konrad, Anthony D. Joseph
Venue: Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video (2001)

The current generation of wireless links pose a significant challenge for sending video streams, as these links have low bit rate and high error rate compared to wired links. Sending high bit rate delay-sensitive traffic over wireless links requires appropriate error resilient video compression algorithms and transport/link layer protocols. We have built a wireless video system using an off-the-shelf error resilient low bit rate video codec with our implementations of UDP Lite and PPP Lite, which are modifications to transport and link layer protocols respectively. The flexible checksumming schemes in these protocols allow error-resilient application policies to be reflected in the networking stack. We conducted simulations and experimental evaluations of this wireless video system using quantitative performance metrics (i.e., throughput, jitter, packet loss, and end-to-end latency).
A constructive algorithm for memory-aware task assignment and scheduling
Authors: Radoslaw Szymanek, Krzysztof Kuchcinski
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

This paper presents a constructive algorithm for memory-aware task assignment and scheduling, which is a part of the prototype system MATAS. The algorithm is well suited for image and video processing applications which have hard memory constraints as well as constraints on cost, execution time, and resource usage. Our algorithm takes into account code and data memory constraints together with the other constraints. It can create pipelined implementations. The algorithm finds a task assignment, a schedule, and data and code memory placement in memory. Infeasible solutions caused by memory fragmentation are avoided. The experiments show that our memory-aware algorithm reduces memory utilization comparing to greedy scheduling algorithm which has time minimization objective. Moreover, memory-aware algorithm is able to find task assignment and schedule when time minimization algorithm fails. MATAS can create pipelined implementations, therefore the design throughput is increased.
Effective access to large audiovisual assets based on user preferences
Authors: S. Ioannou, G. Moschovitis, K. Ntalianis, K. Karpouzis, S. Kollias
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

Current multimedia databases contain a wealth of information in the form of audiovisual, as well as text data. Even though efficient search algorithms have been developed for either media, there still exists the need for abstract presentation and summarization of the results of database users' queries. Moreover, multimedia retrieval systems should be capable of providing the user with additional information related to the specific subject of the query, as well as suggest other topics which users with a similar profile are interested in. In this paper, we present a number of solutions to these issues, giving as an example an integrated architecture we have developed, along with notions that support efficient and secure Internet access and easy addition of new material. Segmentation of the video in shots is followed by shot classification in a number of predetermined categories. Generation of users' profiles according to the same categories, enhanced by relevance feedback, permits an efficient presentation of the retrieved video shots or characteristic frames in terms of the user interest in them. Moreover, this clustering scheme assists the notion of &ldquo;lateral&rdquo; links that enable the user to continue retrieval with data of similar nature or content to those already returned. Furthermore, user groups are formed and modeled by registering actual preferences and practices; this enables the system to &ldquo;predict&rdquo; information that is possibly relevant to specific users and present it along with the returned results. The concepts utilized in this system can be smoothly integrated in MPEG-7 compatible multimedia database systems.
Computer capabilities at western european universities
Authors: Aaron Finerman
Venue: Communications of the ACM (1966)

This report on the author's trip to universities in Western Europe in the summer of 1966 gives brief descriptions of computing activities at each institution visited. Present equipment capabilities vary from moderate to large scale; however, many institutions plan to acquire complex time-shared systems in the near future. In the author's opinion, the state of the art lags behind that on this continent. This lag is attributed to four principal factors: (a) the handicapping organization of academic procedures; (b) the university-government financial relationship; (c) the subordinated organization of the computing facility; (d) the paucity of professional interchange of knowledge. The effects of these constraints are explicated.
Evaluation of coupling in the context of Java interfaces (poster session)
Authors: Mohsen D. Ghassemi, Ronald R. Mourant
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Several coupling frameworks have been introduced in the literature to identify and measure the design complexity of object-oriented software systems. The coupling metric COF presented by the unified framework considers inheritance, polymorphism, method overriding, and direct methods of invocations to identify possible interactions in the system that contribute to the software complexity. We evaluate the COF metric in the context of Java interfaces. Interactions are identified, the effectiveness of the model is discussed, and an extension of the model is offered for more accurate measurement of complexity.
A smart position sensor for 3-D measurement
Authors: Tomohiro Nezuka, Masashi Hoshino, Makoto Ikeda, Kunihiro Asada
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

A smart position sensor for 3-D measurement has been developed. The sensor is designed for detecting positions of laser spots projected on target objects quickly. The sensor has a 256 x 256 pixel array, a set of address decoders for variable block access and a variable block logical-OR circuit on an 8.9mm x 8.9mm die. The sensor is designed and fabricated in 0.6um CMOS 3-metal 2-poly-Si process. The measured accuracy of 3-D measurement is 0.4%. The speed of 3-D measurement is up to 10000points/s.
Graph coloring conditions for the existence of solutions to the timetable problem
Authors: G. A. Neufeld, J. Tartar
Venue: Communications of the ACM (1974)

A necessary and sufficient condition is presented for the existence of a solution to the Gotlieb class-teacher timetable problem. Several relationships are established between the class-teacher timetable problem and graphs with preconditions. These preconditions place additional restrictions on the coloration of a graph. The preconditions correspond to the unavailability constraints and preassigned meetings in the class-teacher timetable problem. Using some recent results that convert graphs with preconditions to graphs without them, it is shown that the existence of a coloration of a graph is the required necessary and sufficient condition.
Tutorial on Technology Transfer and Survey Design and Data Collection for Measuring Internet and Intranet Existence, Usage, and Impact (Survey-2000) in Acute Care Hospitals in the United States
Authors: Myron Hatcher
Venue: Journal of Medical Systems (2001)

This paper provides a tutorial of technology transfer for management information systems in health care. Additionally it describes the process for a national survey of acute care hospitals using a random sample of 813 hospitals. The purpose of the survey was to measure the levels of Internet and Intranet existence and usage in acute care hospitals. The depth of the survey includes e-commerce for both business to business and with customers. The relationships with systems approaches, user involvement, user satisfaction and decision-making will be studied. Changes with results of a prior survey conducted in 1997 can be studied and enabling and inhabiting factors identified. This information will provide benchmarks for hospitals to plan their network technology position and to set goals.
A note on cycle covering
Authors: Jean-Claude Bermond, David Coudert, Lilian Chacon, François Tilerot
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

This study considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other.
TRAC, a procedure-describing language for the reactive typewriter
Authors: Calvin N. Mooers
Venue: Communications of the ACM (1966)

A description of the TRAC (Text Reckoning And Compiling) language and processing algorithm is given. The TRAC language was developed as the basis of a software package for the reactive typewriter. In the TRAC language, one can write procedures for accepting, naming and storing any character string from the typewriter; for modifying any string in any way; for treating any string at any time as an executable procedure, or as a name, or as text; and for printing out any string. The TRAC language is based upon an extension and generalization to character strings of the programming concept of the &ldquo;macro.&rdquo; Through the ability of TRAC to accept and store definitions of procedures, the capabilities of the language can be indefinitely extended. TRAC can handle iterative and recursive procedures, and can deal with character strings, integers and Boolean vector variables.
A note on minimal length polygonal approximation to a digitized contour
Authors: U. Montanari
Venue: Communications of the ACM (1970)

A method for extracting a smooth polygonal contour from a digitized image is illustrated. The ordered sequence of contour points and the connection graph of the image are first obtained by a modified Ledley algorithm in one image scan. A minimal perimeter polygon subjected to specified constraints is then chosen as the approximating contour. The determination of the minimal polygon can be reduced to a nonlinear programming problem, solved by an algorithm which takes into account the weak bonds between variables. Some examples are presented, and the corresponding computing times are listed.
Spatial standardization
Authors: George S. Carson
Venue: ACM SIGGRAPH Computer Graphics (2000)

This Standards Pipeline reports on recent work within the international standards community to coordinate standards efforts that deal with spatial information, and especially geo-spatial information. Two special meetings on this topic were recently held. The first meeting was at Sun Microsystems in Menlo Park, CA, February 14-16, 2000 and the second at ISO headquarters in Geneva, Switzerland on May 2-4, 2000.
Parallel Krylov Methods for Econometric Model Simulation
Authors: Giorgio Pauletto, Manfred Gilli
Venue: Computational Economics (2000)

This paper investigates parallel solution methods to simulate large-scale macroeconometric models with forward-looking variables. The method chosen is the Newton-Krylov algorithm, and we concentrate on a parallel solution to the sparse linear system arising in the Newton algorithm. We empirically analyze the scalability of the GMRES method, which belongs to the class of so-called Krylov subspace methods. The results obtained using an implementation of the PETSc 2.0 software library on an IBM SP2 show a near linear scalability for the problem tested.
Equivalence checking of integer multipliers
Authors: Jiunn-Chern Chen
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, we address on equivalence checking of integer multipliers, especially for the multipliers without structure similarity. Our approach is based on Hamaguchi's backward substitution method with the following improvements: (1) automatic identification of components to form proper cut points and thus dramatically improve the backward substitution process, (2) a layered-backward substitution algorithm to reduce the number of substitutions, and (3) Multiplicative Power Hybrid Decision Diagrams(*PHDDs) as our word-level representation rather than *BMD in Hamaguchi's approach. Experimental results show that our approach can efficiently check the equivalence of two integer multipliers. To verify the equivalence of a 32 x 32 array multiplier versus a 32 x 32 Wallace tree multiplier, our approach takes about 57 CPU seconds using 11 Mbytes, while Stanion's approach took 21027 seconds using 130 MBytes. We also show that the complexity of our approach grows cubically O(n3).
Machine controls for analysis of variance
Authors: Roger J. Weldon
Venue: Communications of the ACM (1964)

A major problem in using the analysis of variance, as the number of factors increases, is the exponential rise in the number of interactions. Even though the experimenter may not be interested in these interactions it is impossible to ignore them in most experimental designs because of the problem of getting error terms. It is natural therefore to look to the computer to handle the bulk of work involved in computing the interactions. A program device to get the computer to do this is described.
Scheduling-based code size reduction in processors with indirect addressing mode
Authors: Sungtaek Lim, Jihong Kim, Kiyoung Choi
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

DSPs are typically equipped with indirect addressing modes with auto-increment and auto-decrement, which provide efficient address arithmetic calculations. Such an addressing mode is maximally utilized by careful placement of variables in storage, thereby reducing the amount of address arithmetic instructions. Finding proper placement of variables in storage is called storage assignment problem and the result highly depends on the access sequence of variables. This paper suggests statement scheduling as a compiler optimization step to generate a better access sequence. Experimental results show 3.6% improvement on the average over naive storage assignment.
Interaction and outeraction: instant messaging in action
Authors: Bonnie A. Nardi, Steve Whittaker, Erin Bradner
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

We discuss findings from an ethnographic study of instant messaging (IM) in the workplace and its implications for media theory. We describe how instant messaging supports a variety of informal communication tasks. We document the affordances of IM that support flexible, expressive communication. We describe some unexpected uses of IM that highlight aspects of communication which are not part of current media theorizing. They pertain to communicative processes people use to connect with each other and to manage communication, rather than to information exchange. We call these processes "outeraction". We discuss how outeractional aspects of communication affect media choice and patterns of media use.
Critical Motions for Auto-Calibration When Some Intrinsic Parameters Can Vary
Authors: Fredrik Kahl, Bill Triggs, Kalle Åström
Venue: Journal of Mathematical Imaging and Vision (2000)

Auto-calibration is the recovery of the full camera geometry and Euclidean scene structure from several images of an unknown 3D scene, using rigidity constraints and partial knowledge of the camera intrinsic parameters. It fails for certain special classes of camera motion. This paper derives necessary and sufficient conditions for unique auto-calibration, for several practically important cases where some of the intrinsic parameters are known (e.g. skew, aspect ratio) and others can vary (e.g. focal length). We introduce a novel subgroup condition on the camera calibration matrix, which helps to systematize this sort of auto-calibration problem. We show that for subgroup constraints, criticality is independent of the exact values of the intrinsic parameters and depends only on the camera motion. We study such critical motions for arbitrary numbers of images under the following constraints: vanishing skew, known aspect ratio and full internal calibration modulo unknown focal lengths. We give explicit, geometric descriptions for most of the singular cases. For example, in the case of unknown focal lengths, the only critical motions are: (i) arbitrary rotations about the optical axis and translations, (ii) arbitrary rotations about at most two centres, (iii) forward-looking motions along an ellipse and/or a corresponding hyperbola in an orthogonal plane. Some practically important special cases are also analyzed in more detail.
A new techology mapping for CPLD under the time constraint
Authors: Jae-Jin Kim, Hi-Seok Kim Chi-Ho Lin
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, we proposed a new technology mapping algorithm for CPLD under the time constraint (TMCPLD-II). In our technology mapping algorithm, we generate the feasible clusters from a given Boolean. The generated feasible clusters create clusters with minimum area under the time constraint. A covered Boolean network is transformed to a Boolean equation. The transformed equations are reconstructed in order to fit to an architecture of selected target CPLD by using collapsing and bin-packing. To demonstrate the efficiency of our approach, we applied our algorithm to MCNC benchmarks and compared the results with those of the existing algorithms. The experimental results show that our approach is better than any of the existing algorithms in the number of logic blocks.
Nomadic radio: speech and audio interaction for contextual messaging in nomadic environments
Authors: Nitin Sawhney, Chris Schmandt
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2000)

Mobile workers need seamless access to communication and information services while on the move. However, current solutions overwhelm users with intrusive interfaces and ambiguous notifications. This article discusses the interaction techniques developed for Nomadic Radio, a wearable computing platform for managing voice and text-based messages in a nomadic environment. Nomadic Radio employs an auditory user interface, which synchronizes speech recognition, speech synthesis, nonspeech audio, and spatial presentation of digital audio, for navigating among messages as well as asynchonous notific ation of nely arrived messages. Emphasis is placed on an auditory modality as Nomadic Radio is designed to be used while performing other tasks in a user's everyday environment; a range of auditory cues provides peripheral awareness of incoming messages. Notification is adaptive and cntext sensitive; messages are presented as more or less obtrsive based on importance inferred from content filtering, whether the user is engaged in conversation and his or her own recent responses to prior messages. Auditory notifications are dynamically scaled from ambient sound through recorded voice cues up to message summaries. Iterative design and a preliminary user evaluation suggest that audio is an appropriate medium for mobile messaging, but that care must be taken to minimally intrude on the wearer's social and physical environment.
Industry collaboration: a practical approach for ERP education
Authors: Paul Hawking, Brendan McCarthy
Venue: Proceedings of the Australasian conference on Computing education (2000)

Enterprise Resource Planning (ERP) systems are large information systems that make possible the efficient flow of information between all functions within a business. ERP sales represent an important component of business spending in information systems infrastructure. Implementing an ERP system is a costly and time-consuming task and these costs are due mainly to the short supply of professionals with ERP skills. ERP vendors, such as SAP, have formed university alliances in an attempt to address this skills shortage. Many of these universities are grasping how best to incorporate ERP systems into their curriculum. This paper discusses the use of industry-based projects in curriculum and the benefits they can provide to industry, university and students.
Autoassociative MLP in Sleep Spindle Detection
Authors: E. Huupponen, A. Värri, S-L. Himanen, J. Hasan, M. Lehtokangas, J. Saarinen
Venue: Journal of Medical Systems (2000)

Spindles are one of the most important short-lasting waveforms in sleep EEG. They are the hallmarks of the so-called Stage 2 sleep. Visual spindle scoring is a tedious workload, since there are often a thousand spindles in one all-night recording of some 8 hr. Automated methods for spindle detection typically use some form of fixed spindle amplitude threshold, which is poor with respect to inter-subject variability. In this work a spindle detection system allowing spindle detection without an amplitude threshold was developed. This system can be used for automatic decision making of whether or not a sleep spindle is present in the EEG at a certain point of time. An Autoassociative Multilayer Perceptron (A-MLP) network was employed for the decision making. A novel training procedure was developed to remove inconsistencies from the training data, which was found to improve the system performance significantly.
Ensuring privacy in presence awareness: an automated verification approach
Authors: Patrice Godefroid, James D. Herbsleb, Lalita Jategaonkar Jagadeesany, Du Li
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

Providing information about other users and their activites is a central function of many collaborative applications. The data that provide this "presence awareness" are usually automatically generated and highly dynamic. For example, services such as AOL Instant Messenger allow users to observe the status of one another and to initiate and participate in chat sessions. As such services become more powerful, privacy and security issues regarding access to sensitive user data become critical. Two key software engineering challenges arise in this context:Policies regarding access to data in collaborative applications have subtle complexities, and must be easily modifiable during a collaboration. Users must be able to have a high degree of confidence that the implementations of these policies are correct. In this paper, we propose a framework that uses an automated verification approach to ensure that such systems conform to complex policies. Our approach takes advantage of VeriSoft, a recent tool for systematically testing implementations of concurrent systems, and is applicable to a wide variety of specification and development platforms for collaborative applications. we illustrate the key features of our framework by applying it to the development of a presence awareness system.