ppxscal/embedding_network huggingface dataset:
Design pattern automation
Authors: Andy Bulka
Venue: Proceedings of the 2002 conference on Pattern languages of programs - Volume 13 (2003)

As design patterns become more mainstream, various IDE's (Integrated Development Environments) and UML modelling software environments have begun to introduce support for design patterns. For example, developers browse through a catalog of design patterns and drop one onto a UML workspace, whereupon various classes appear with the appropriate methods and attributes in serted. This paper explores the state of pattern automation software, discusses the pros and cons of various approaches and then goes on to discusses the broader issues raised by the attempt to automate something which some argue, in principle, perhaps should not be automated at all.
Equality of streams is a Π0 over 2-complete problem
Authors: Grigore Roşu
Venue: ACM SIGPLAN Notices (2006)

This paper gives a precise characterization for the complexity of the problem of proving equal two streams defined with a finite number of equations: Π0 over 2. Since the Π 0 over 2 class includes properly both the reursively enumerable and the corecursively enumerable classes, this result implies that neither the set of pairs of equal streams nor the set of pairs of unequal streams is recursively enumerable. Consequently, one can find no algorithm for determining equality of streams, as well as no algorithm for determining inequality of streams. In particular, there is no complete proof system for equality of streams and no complete system for inequality of streams.
Camera View-Based American Football Video Analysis
Authors: Yi Ding, Guoliang Fan
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

We present a top-down statistical modeling approach to explore the semantic structure in American football video. First, a semantic space is defined where the video semantic structure is characterized by semantic units, a dynamic model over semantic units, and an observation model for mapping the semantic units with the visual features. Then, a new hidden Markov model (HMM)-based video generative model is proposed for American football video analysis, where semantic units are defined as latent or hidden states corresponding to four different camera views in the football field. A set of relevant visual features are selected based on the information gain for HMM training and two kinds of state emission function, Gaussian or the Gaussian mixture model (GMM), which characterize the observation density function associated with each latent state and are tested in the proposed HMM for camera view-based video analysis. Experimental results on several real football videos manifest the effectiveness of the proposed algorithm. It is shown that the HMM with GMM emission shows advantages over the Gaussian-based one in terms of the classification accuracy of video shots.
MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least-Squares Problems
Authors: Na Li, Yousef Saad
Venue: SIAM Journal on Matrix Analysis and Applications (2006)

This paper describes a multilevel incomplete QR factorization for solving large sparse least-squares problems. The algorithm builds the factorization by exploiting structural orthogonality in general sparse matrices. At any given step, the algorithm finds an independent set of columns, i.e., a set of columns that have orthogonal patterns. The other columns are then block orthogonalized against columns of the independent set, and the process is repeated recursively for a certain number of levels on these remaining columns. The final level matrix is processed with a standard QR or incomplete QR factorization. Dropping strategies are employed throughout the levels in order to maintain a good level of sparsity. A few improvements to this basic scheme are explored. Among these is the relaxation of the requirement of independent sets of columns. Numerical tests are proposed which compare this scheme with the standard incomplete QR preconditioner, the robust incomplete factorization preconditioner, and the algebraic recursive multilevel solver (on normal equations).
Human visual perception of region warping distortions
Authors: Yang-Wai Chow, Ronald Pose, Matthew Regan, James Phillips
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Interactive virtual reality requires at least 60 frames per second in order to ensure smooth motion. For a good immersive experience, it is also necessary to have low end-to-end latency so that user interaction does not suffer from perceptible delays in images presented to the eyes. The Address Recalculation Pipeline (ARP) architecture reduces end-to-end latency in immersive Head Mounted Display (HMD) virtual reality systems. By using the ARP in conjunction with priority rendering, different sections of the scene are updated at different rates. This reduces the overall rendering load and allows for more complex and realistic scenes. Large object segmentation in conjunction with priority rendering further reduces the overall rendering load. However, scene tearing artefacts potentially emerge and region warping was devised to alleviate this. In compensating for the tearing, region warping introduces slight distortions to the scene.Immersive virtual reality systems have humans as integral parts of the system. While researchers do thorough measurements and evaluation of hardware and software performance, the human experience and perception of the system is often neglected. This paper addresses this important issue. We describe our human visual perceptual experimental methodology in detail and present some initial results. Initial experiments in human visual perception of region warping distortions show interesting characteristics which lead us to propose further experimental investigations to clarify their significance.
A Reducing Multi-Noise Contrast Enhancement Algorithm for Infrared Image
Authors: Changjiang Zhang, Xiaodong Wang, Haoran Zhang, Ganyun Lv, Han Wei
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

A kind of infrared image contrast enhancement algorithm based on discrete stationary wavelet transform (DSWT) and non-linear gain operator is proposed. Having implemented DSWT to an infrared image, de-noising is done by the method proposed in the high frequency sub-bands which are in the better resolution levels and enhancement is implemented by combining de-noising method with in-complete Beta transform (IBT) in the high frequency sub-bands which are the worse resolution levels. According to experimental results, the new algorithm can reduce effectively the correlative noise (1/f noise), additive gauss white noise (AGWN) and multiplied noise (MN) in the infrared image while it also enhances the contrast of infrared image well. In visual quality, the algorithm is better than the traditional unshaped mask method (USM), histogram equalization method (HIS) and other two methods in Ref. [3] and Ref. [5].
The boss online submission and assessment system
Authors: Mike Joy, Nathan Griffiths, Russell Boyatt
Venue: Journal on Educational Resources in Computing (JERIC) (2005)

Computer programming lends itself to automated assessment. With appropriate software tools, program correctness can be measured, along with an indication of quality according to a set of metrics. Furthermore, the regularity of program code allows plagiarism detection to be an integral part of the tools that support assessment. In this paper, we describe a submission and assessment system, called BOSS, that supports coursework assessment through collecting submissions, performing automatic tests for correctness and quality, checking for plagiarism, and providing an interface for marking and delivering feedback. We describe how automated assessment is incorporated into BOSS such that it supports, rather than constrains, assessment. The pedagogic and administrative issues that are affected by the assessment process are also discussed.
Linear estimation using covariance information in distributed parameter systems with non-independent uncertainty
Authors: S. Nakamori, A. Hermoso-Carazo, J. Linares-Pérez
Venue: Signal Processing (2006)

Recursive algorithms for the linear least mean-squared one-stage prediction, filtering and fixed-point smoothing problems are obtained in distributed parameter systems with uncertain observations, when only the information on the first and second-order moments of the signal and observation noise is available. It is assumed that the variables describing the uncertainty in the observations are not necessarily independent. The algorithms for the different estimation problems are derived by using the orthogonal projection technique and the invariant imbedding method and they require that the covariance function of the signal can be expressed in a semi-degenerate kernel form.
Dogleg paths and trust region methods with back tracking technique for unconstrained optimization
Authors: Cheng-jing Wang
Venue: Applied Mathematics and Computation (2006)

In this paper, we improve approximate trust region methods via a class of dogleg paths for unconstrained optimization. The dogleg paths include both definite and indefinite ones. A hybrid strategy using both trust region and line search techniques is adopted which switches to back tracking steps when a trial step produced by the trust region subproblem is unacceptable. We show that the algorithm preserves the strong convergence properties of trust region methods. Numerical results are presented and discussed.
SRC-based Cache Coherence Protocol in Chip Multiprocessor
Authors: Haixia Wang, Dongsheng Wang, Peng Li
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

How to improve the scalability of snooping protocol and reduce the memory access latency of directorybased protocol are critical problems for performance optimization of multiprocessor systems. In this paper, we present an SRC (Sharing Relation Cache)-based protocol for chip multiprocessor architecture, in which protocol SRC is used to cache recently appeared sharing relations in case reuse in the near future. A two-phase write scheme is introduced to allow SRCbased protocol applicable not only in in-order network but also out-order network topology. By making full use of the temporal locality of sharing relations among processors, SRC-based protocol can heavily reduce the message traffic in CMP cache coherence protocols compared with snooping protocol. At the same time, SRC-based protocol has better memory access latency than directory-based protocol.
A plausible inference prototype for the Semantic Web
Authors: David J. Russomanno
Venue: Journal of Intelligent Information Systems (2006)

This paper presents a prototype that is capable of drawing plausible inferences from Resource Description Framework (RDF) assertions that are constituents of a distributed, Semantic Web knowledge system. The approach taken to build the prototype can be viewed as the extension and adaptation of a classical approach to plausible inference to exploit the evolving infrastructure being developed to represent declarative knowledge on the Semantic Web. The approach includes a knowledge representation formalism that supports meta properties, which define precise semantics, enabling subsequent plausible inferences via extended composition of RDF properties. Most research and development in the context of the Semantic Web has been devoted to representational infrastructure and accompanying query and logical deduction formalisms to evolve the Web from a document repository to a set of distributed knowledge bases. The work presented in this paper provides a functioning Semantic Web application in which the generation of new inferences is not contained within the deductive closure of the knowledge and data expressed by a collection of information sources represented using RDF. Moreover, the paper provides a concrete example of an RDF schema and a working system built around it which demonstrates one potential use of meta data on the Web.
Perceptually Optimal JPEG2000 Coding of Color Images
Authors: Chun-Hsien Chou, Kuo-Cheng Liu
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Human eyes are ultimate receivers of color images, while the human visual system (HVS) has limited sensitivity in discriminating color signals of small dzflerences. To the human vision, there exists in color images a certain amount of perceptual redundancy. By accurately measuring the perceptual redundancy inherent in color images and shaping coding distortion into the perceptual redundancy, color images are expected to be represented more eficiently. This paper presents a visual model for measuring the perceptual redundancy inherent in color images, and an approach to perceptually optimize the PEG2000 coders for color images by making coding errors the perceptual redundancy. The visual model employs Euclidean metric in the uniform color space to find for each pixel the range of colors which are perceptually indistinguishable from the color of the pixel in the color space it is represented. The JPEG2000 coder is refined by minimizing the perceptible distortion involved in the rate control of the compressed image in the YCbC, color space. Simulation results show that, in both cases, the performance of the perceptually tuned coder is superior to that of the un-tuned coder in terms of the bit rate required for achieving the same visual quality.
Crosstalk-aware routing resource assignment
Authors: Hai-Long Yao, Yi-Ci Cai, Qiang Zhou, Xian-Long Hong
Venue: Journal of Computer Science and Technology (2005)

Crosstalk noise is one of the emerging issues in deep sub-micrometer technology which causes many undesired effects on the circuit performance. In this paper, a Crosstalk-Aware Routing Resource Assignment (CARRA) algorithm is proposed, which integrates the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage. The CARRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max clique of the graph. Then the nets in each max clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested on IBM benchmarks and the experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.
The Moment Camera
Authors: Michael F. Cohen, Richard Szeliski
Venue: Computer (2006)

Future cameras will let us "capture the moment," not just the instant when the shutter opens. The moment camera will gather significantly more data than is needed for a single image. This data, coupled with automated and user-assisted algorithms, will provide powerful new paradigms for image making.
Commercializing a multiagent-supported collaborative system
Authors: Leen-Kiat Soh, Hong Jiang
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In this paper, we describe our effort and lessons learned in commercializing an innovative infrastructure to support student participation and collaboration and help the instructor manage large or distance classrooms using multiagent system intelligence. The system, called I-MINDS, has a host of intelligent agents for each classroom: a teacher agent ranks and categorizes real-time questions from the students and collects statistics on student participation, a number of group agents that each maintains a collaborative group and facilitate student discussions, and a student agent for each student that profiles a student and finds compatible students to form the student's "buddy group". Our commercialization plan is three-fold: (1) to strengthen our understanding of potential customers, (2) to understand our competitors and alternative products, and (3) to examine and estimate the market potential for I-MINDS. To accomplish the above, we have conducted experiments to further investigate the impact of I-MINDS in actual use, comprehensive research on existing products and technologies, secure legal protection of our technology, plug-and-play I-MINDS for various demonstrations to companies for joint research and development.
Stereo Matching with Color-Weighted Correlation, Hierachical Belief Propagation and Occlusion Handling
Authors: Qyngxiong Yang, Liang Wang, Ruigang Yang, Henrik Stewenius, David Nister
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matching stereo model based on an energy- minimization framework. The global energy contains two terms, the data term and the smoothness term. The data term is first approximated by a color-weighted correlation, then refined in occluded and low-texture areas in a repeated application of a hierarchical loopy belief propagation algorithm. The experimental results are evaluated on the Middlebury data set, showing that our algorithm is the top performer.
Application of a portable minicomputer system in a research/student laboratory environment
Authors: Joseph F. Nebolon
Venue: ACM SIGSMALL Newsletter (1980)

A portable minicomputer system (PDP 11/03) including floppy disk drives, lineprinter, graphics plotter, A/D, parallel and serial interfaces, even-timing circuitry, and user-designed data base software, is the focus of this paper. The system is located in a laboratory used for both undergraduate instructional purposes and graduate level research. A variety of experimental applications of this system will be discussed, although special attention will be paid to our steady state engine testing faciltiy. In this experiment the data acquisition system monitors a large number of engine operating conditions as well as a bank of seven exhaust gas analyzers. The operator views a CRT screen displaying all engine parameters, exhaust composition, and warning diagnostics.Briefly stated, over two years experience with this system has had three main effects upon this department: (1) exposing undergraduate mechanical engineering students to modern computer-aided experimental techniques, (2) increasing the quality and quantity of data taken, and (3) providing the experimentalist with convenient access to the data. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Data Doughnut and the Software Hole
Authors: Neville Holmes
Venue: Computer (2006)

In computing, the data is the end, the programs merely the means.
Composing Web Services with PEWS: A Trace-Theoretical Approach
Authors: Cheikh Ba, Mirian Halfeld Ferrari, Martin A. Musicante
Venue: Proceedings of the European Conference on Web Services (2006)

PEWS^1 is an interface description language for both individual and composed web services. Individual web services are expressions over WSDL-defined operations while composed web services are expressions over PEWS-defined services. This paper distinguishes two dimensions of PEWS. The control dimension describes the control workflow of the service, i.e. the order in which the operations of the web service will be executed. No data constraints are imposed. The data dimension adds information flow to the control dimension. In order to analyse the composability and the substitutability of composed services, we introduce a trace-theoretical presentation of the language constructs. Our long-term goal is to integrate PEWS into a web service design system that checks useful properties of the service specification.
On stability of the solutions of a class of nonlinear delay systems
Authors: A. Yu. Aleksandrov, A. P. Zhabko
Venue: Automation and Remote Control (2006)

Consideration was given to a class of systems of nonlinear differential equations with retarded argument. It was assumed that in the absence of delay the zero solutions of the systems under study are asymptotically stable. Using the method of Lyapunov functions in the form of B.S. Razumikhin, it was proved that if the right-hand sides of these equations are free of the linear terms relative to the phase variables, then the asymptotic stability is retained for any delay.
A Study ofWeb Services Transactions Based on Real-time \pi Calculus
Authors: Huaiguang Wu, Farong Zhong
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Transactions of Web services are used to describe open component-based distributed applications. In this paper, we define a calculus of long-running transactions which bases on real time \pi calculus and is independent of idiographic description proposals of web services. We discuss its syntax and semantics and demonstrate its strong (weak) timed bisimulation.
Multisensory integration for pilot spatial orientation
Authors: Ronald Small, Christopher Wickens, John Keller, Alia Oster
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Spatial disorientation (SD) is a normal human response to accelerations in flight. Its cost to the US military is over $300 million per year, with comparable costs to US civil aviation. Despite significantly increased research over the past decade, the rate of accidents caused by SD has not decreased. While the most recent research emphases have been on understanding the physiology of SD, the translation of the new knowledge into tools (e.g., training, displays, automation) that help pilots avoid SD and minimize its effects if it does happen, has not occurred. Our research goals were to apply multisensory countermeasures (CMs) to SD based on human sensory models and the pilot's workload. We used SD mishap flight simulations to test our models and pilot SD Aiding System.
Modelling human perception to leverage the reuse of concepts across the multi-sensory design space
Authors: Keith V. Nesbitt
Venue: Proceedings of the 3rd Asia-Pacific conference on Conceptual modelling - Volume 53 (2006)

Information Visualisation is an emerging discipline that concerns the design of interactive computer systems that provide the user with a visual model of abstract data. Information Visualisation implies a mapping from the data attributes to the units of visual perception. Information Sonification is an embryonic field that uses sound rather than imagery to present abstract data. Information Sonification, implies a mapping from the data attributes to the units of auditory perception. In both these fields the need to describe appropriate mappings between the data and the units of perception has led to models or taxonomies that describe the available design space. While these models of the visual design space and the auditory design space may be appropriate for people working in a single sensory domain, these models based purely on sensory attributes are very disjoint. However, for designers who wish to consider a multisensory solution to information display, these disjoint models of the different sensory domains make it difficult to compare and contrast the possible mapping choices.This paper describes existing conceptual models of the visual and auditory design space and then proposes a different conceptual modelling of the multisensory design space. This new model describes the units of perception but is not based on sensory attributes, but typical information metaphors. Throughout the paper all discussions are illustrated using the UML modelling notation which is a standard notation used to document the design of software systems.