ppxscal/embedding_network huggingface dataset:
Matching Relational Structures using the Edge-Association Graph
Authors: Andrea Torsello, Andrea Albarelli, Marcello Pelillo
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

The matching of relational structures is a problem that pervades computer vision and pattern recognition research. A classic approach is to reduce the matching problem into one of search of a maximum clique in an auxiliary structure: the association graph. The approach has been extended to incorporate vertex-attributes by reducing it to a weighted clique problem, but the extension to edge-attributed graphs has proven elusive. However, in vision problems, quite of- ten the most relevant information is carried by edges. For example, when the graph abstracts scene layout, the edges can represent the relative position of the detected features, which abstracts the geometry of the scene in a way that is invariant to rotations and translations. In this paper, we provide a generalization of the association graph frame- work capable of dealing with attributes on both vertices and edges. Experiments are presented which demonstrate the effectiveness of the proposed approach.
Whole-frame Error concealment with improved backward motion estimation for H.264 decoders
Authors: Shi-Chen Sui, Feng Liu, Ping Xue
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

H.264 video compression standard is widely used in video transmission for telecommunications field, with a higher compression ratio and excellent network adaptability. But it also decreases the performance in anti-interference capabilities. More than one frame pictures of encoding data is stored in a data packet, once the data packet occur errors in transmission, the whole frame image is completely lost, and the next several frames can not be decoded well . Therefore, we must take the decoder error conceal technology to improve the ability of error resilient. This paper presents an error conceal method for whole-frame loss by using improved backward motion estimation. More precise quarter-pixel motion estimation to conceal the un-mapped pixel from previous correct decoded frame to current damaged frame is used to improve the quality of reconstructed frame, and spatial conceal method of distance-weighted average method is used to reduce the blocking-effect. Experiment results show it is effective.
A Survey of Fault Tolerant Computer Architecture and its Evaluation
Authors: W. C. Carter
Venue: Computer (1971)

In striving to design highly reliable, highly available computers, two basic strategies have been employed: increasing the reliability throug-h advances in component technology; and designing self-repairing computers which use functional redundancy to permit correct performance (perhaps in a degraded manner) in the presence of component failures. Time has shown a fluctuation in the popularity of each strategy, based primarily on changes in technologies, applications and costs.
Combinatorial Stokes formulae
Authors: Frédéric Meunier
Venue: European Journal of Combinatorics (2008)

For an n-dimensional pseudomanifold whose vertices get labels from a finite set, there is a ''combinatorial Stokes'' formula, found by Ky Fan, which links the number of simplices getting n different labels on the boundary with the number of simplices getting n+1 different labels. In 1998, a generalization of this formula was proved by Lee and Shih taking into account the possibility of putting several labels on each vertex. We re-prove and generalize this latter combinatorial Stokes formula in a rather simple and natural way. Furthermore, some applications of the combinatorial Stokes formula of Fan are given; one of them provides a new combinatorial proof of Schrijver's theorem about Kneser graphs.
Computers and the Humanities
Authors: P. Bratley
Venue: Computer (1978)

It is as difficult, and perhaps as silly, to try to present the field of computing in the humanities in one special issue, as it would be to present computing in business, say, or the scientific applications of computers. Nevertheless, the effort seems worth making. Much of the work in this area is genuinely interdisciplinary: for interdisciplinary projects to take shape and to prosper, it is essential that workers on one side of the line be regularly reminded of what is happening on the other.
RRAND: A New Requirement Aware RAND based Flexible Slot Allocation Mechanism Optimized For Spatial Reuse Of Slots
Authors: Yuvraj Krishna Rana, Sanjay Jha
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Schedule based MAC schemes do not perform well for dynamic network and traffic conditions. Their inflexibility makes them unsuitable for most real life applications. This inflexibility is due to the nature of schedule based approach. However, it depends mainly on the re-scheduling and slot allocation strategies employed. A flexible schedule based scheme should allow for the nodes to access the medium with different periodicity. The periodicity should be based on their traffic requirements which may result in improved channel utilization. However, traditionally used slot allocation protocols, e.g. RAND[1], do not consider the required medium access periodicity while allocating slot to the node. Thus, resulting schemes are not flexible to dynamic traffic conditions. This results in bandwidth wastage. In this paper, we propose a new flexible requirement aware RAND (RRAND) mechanism to allocate slots efficiently. Through simulations we show that our mechanism improves channel utilization on an average by about 60%. The fairness characteristics are also improved significantly.
ARMS -- application of AI and OR methods to resource management
Authors: G. Owusu, C. Voudouris, R. Dorne, C. Ladde, G. Anim-Ansah, K. Gasson, G. Connolly
Venue: BT Technology Journal (2007)

This paper documents work on automating resource management in BT Retail. BT Retail manages BT's access network and provides telecommunications services to its customers. BT Retail's field engineers are allocated jobs via an information system known as Work Manager. In order to proactively position the engineers (i.e. resources) so as to service jobs in an optimal manner, resource managers are involved in analysing the profiles of engineers in the light of incoming jobs and 'selecting' those profiles that will yield best quality of service and reduce operational costs. A profile is a set of attributes that define a resource's capabilities (i.e. skills), capacity (i.e. availability), and location (i.e. area). Resource planning involves identifying an `optimal' set of resource profiles. Accurate workload forecasting is sine qua non for optimal resource planning. To this end we have developed ARMS, Automated Resource Management System, a suite of components for workload forecasting and resource planning.
Storage CRT Display Terminals: Evolution and Trends
Authors: R. B. Preiss
Venue: Computer (1978)

Storage-tube display technology and costs will continue to attract new users and new applications, especially where very high information density is needed. 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
Bipartite graph matching for video clip localization
Authors: Zenilton Kleber G. do Patrocinio Jr., Silvio Jamil F. Guimaraes, Hugo Bastos de Paula
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the maximum cardinality matching of a bipartite graph to measure video clip similarity with a target video stream which has not been preprocessed. We show that our approach locates edited video clips, but it does not deal with insertion and removal of frames/shots, allowing only changes in the temporal order of frames/shots. All experiments performed in this work have achieved 100% of precision for two different video datasets. And according to those experiments, our method can achieve a global recall rate of 90%.
Software Renewal: A case Study
Authors: H. M. Sneed
Venue: IEEE Software (1984)

Error-free software in large applications may be possible only by respecifying the original design-and may be affordable only when automatic tools become available.
The Maxc Systems
Authors: E. R. Fiala
Venue: Computer (1978)

The development odfthis timesharing led to insights on micrporogrammable organization, instruction sets, reliabiilty, and software and firmware development tools.
On a Method of Sequential Pattern Recognition
Authors: A. Som
Venue: IEEE Transactions on Computers (1972)

In this paper, a multistage linear programming method of pattern recognition is proposed. The usual n-dimensional linear program has been split up into n stages of a one-dimensional linear program in such a way that more and more patterns belonging to two classes A and B are correctly classified as we proceed to higher and higher stages. It has been shown that if the threshold is kept fixed for ali the stages, the formulation of the problem entails a preprocessing of the feature coordinates; on the other hand, if the threshold is allowed to be different values in different stages, no such preprocessing is required. The application of the proposed method for the recognition of two handwritten Bengali characters has been discussed and compared with the results of other methods.
Islands of Applications
Authors: H. L. Gamer
Venue: Computer (1972)

The papers which follow are part of the technical program of the "Islands of Applications" conference which was held June 8-13, 1972 in Tokyo, Japan. This conference was co-sponsored by the IEEE Computer Society and the United States Department of Commerce. The conference was held in conjunction with the Second United States Solo Computer Exhibition and the conference provided a forum for discussions of computer applications in many key areas. The conference technical program resulted from a joint Japanese-American effort. Dr. Hiroshi Sinkawa and the author served as conference co-chairmen. Special thanks must be given to Professor Tonau Osatake and Professor Hisao Yamada, both of the University of Tokyo, who are most helpful in obtaining session co-chairmen and papers from the Japanese authors. The conference technical program consisted of 27 papers. 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
VoIP Secure Communication Protocol satisfying Backward Compatibility
Authors: Joongman Kim, Seokung Yoon, Yoojae Won, Jaeil Lee
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Several VoIP security protocols have been standardized for preventing many VoIP threats. But since several VoIP carriers have different VoIP protocols, end-to-end VoIP secure communication can not be possible. Also when initiator using secure VoIP phone wants a secure communication with responder using non-VoIP phone such as PSTN phone, or cellular phone, etc, so does it. Therefore, we propose VoIP secure communication protocols satisfying backward compatibility.
Statistical constraints in nanocrystal memory scaling
Authors: Riccardo Gusmeroli, Christian Monzio Compagnoni, Alessandro S. Spinelli
Venue: Microelectronic Engineering (2007)

This paper presents a detailed investigation of the statistical constraints that may limit nanocrystal memory scaling to the deca-nanometer scale-size. We adopted a Monte Carlo simulation approach to evaluate the probability distribution of the threshold voltage shift after program and of the retention time in presence of stress-induced leakage current. These distributions were used to extract a program and a retention fail probability. Both of them increase with cell dimensions scaling, strongly reducing the benefits offered by the nanocrystal technology in future microelectronics nodes.
Design automation of real-life asynchronous devices and systems
Authors: Alexander Taubin, Jordi Cortadella, Luciano Lavagno, Alex Kondratyev, Ad Peeters
Venue: Foundations and Trends® in Electronic Design Automation (2007)

The number of gates on a chip is quickly growing toward and beyond the one billion mark. Keeping all the gates running at the beat of a single or a few rationally related clocks is becoming impossible. In static timing analysis process variations and signal integrity issues stretch the timing margins to the point where they become too conservative and result in significant overdesign. Importance and difficulty of such problems push some developers to once again turn to asynchronous alternatives. However, the electronics industry for the most part is still reluctant to adopt asynchronous design (with a few notable exceptions) due to a common belief that we still lack a commercial-quality Electronic Design Automation tools (similar to the synchronous RTL-to-GDSII flow) for asynchronous circuits. The purpose of this paper is to counteract this view by presenting design flows that can tackle large designs without significant changes with respect to synchronous design flow. We are limiting ourselves to four design flows that we believe to be closest to this goal. We start from the Tangram flow, because it is the most commercially proven and it is one of the oldest from a methodological point of view. The other three flows (Null Convention Logic, de-synchronization, and gate-level pipelining) could be considered together as asynchronous re-implementations of synchronous (RTL-or gate-level) specifications. The main common idea is substituting the global clocks by local synchronizations. Their most important aspect is to open the possibility to implement large legacy synchronous designs in an almost "push button" manner, where all asynchronous machinery is hidden, so that synchronous RTL designers do not need to be re-educated. These three flows offer a trade-off from very low overhead, almost synchronous implementations, to very high performance, extremely robust dual-rail pipelines.
A Scalable Quality of Service Middleware System with Passive Monitoring Agents over Wireless Video Transmission
Authors: Tomi Raty, Johannes Oikarinen, Markus Sihvonen
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

We have constructed a Scalable Quality of Service middleware system, which contains a monitoring user agent client, a monitoring user agent server and a leader agent. A network camera sends video transmission to the smart phone. The video transmission transits through a Scalable Quality of Service server. The monitoring user agent client resides in the smart phone. The monitoring user agent server and leader agent reside in the Scalable Quality of Service server. Both monitoring user agents monitor the video transmission's bit-rate. The monitoring user agents transmit their evaluation to the leader agent. Then the leader agent deducts whether to ordain the network camera to scale the Quality of Service values down or up. The research problem of the paper is to determine a middleware, which improves the control of the video transmission over a mobile system. Our innovative theories are the Scalable Quality of Service middleware system's architecture, passive monitoring paradigm, and calculation and deduction methods. The theories endeavor to optimize the video transmission rate to a smart phone over a wireless network. The operability of the constructed prototype indicates that this endeavor is attained. The research is based on the constructive method of the related publications and technologies and the results are derived by the implemented Scalable Quality of Service middleware system.
Modified Luminance Based Adaptive MSR
Authors: Bo Sun, Weifang Chen, Hongyu Li, Wenjing Tao, Jiang Li
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

A modified Luminance Based Adaptive MSR is proposed in this paper. This new method addresses the problems existing in standard Retinex algorithms, such as halo artifacts and incorrect colors. The paper chooses an adaptive Gaussian function whose shape follows edges of image, thus reducing the artifacts along high contrast edges. In addition, only the luminance channel instead of all color bands is processed, which can produce a more consistent and reliable color rendition.
Pripayd: privacy friendly pay-as-you-drive insurance
Authors: Carmela Troncoso, George Danezis, Eleni Kosta, Bart Preneel
Venue: Proceedings of the 2007 ACM workshop on Privacy in electronic society (2007)

Pay-As-You-Drive insurance systems are establishing themselves as the future of car insurance. However, their current implementations entail a serious privacy invasion. We present PriPAYD where the premium calculations are performed locally in the vehicle, and only aggregate data arrivesto the insurance company, without leaking location information. Our system is built on top of well understood security techniques that ensure its correct functioning. We discuss the viability of PriPAYD in terms of cost, security and easeof certification.
Classification and Existence of Non-oscillatory Solutions for Two-Dimensional Neutral Difference System
Authors: Binbin Du, Guang Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, the classification of nonoscillatory solutions for a two-dimensional neutral difference system is considered. Sufficient and/or necessary conditions of existence for those solutions will be established.
A Clustering Approach to Object Estimation, Featuring Image Filtering Prototyping for DBSCAN in Virtual Sets
Authors: Luca Bianchi, Alessandro Martinelli
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper we propose an innovative approach to object shape and position estimation by stereometric, data mining and interpolating techniques. Our proposed system would be able to work with real-time performances. Unfortunately the most computational expensive part of our solution is clustering. To achieve our goal we also propose a new prototypes estimation technique based on the application of fast image filters to the point set before clustering, stressing and adapting the filter concept to a non Image context. These filters can be easily computed on Graphic Processing Unit (GPU), reducing the data amount in the clustering phase), achieving fast execution performances as for the other stages of our system.
Did the Price of the Internet Drop?
Authors: Shane Greenstein
Venue: IEEE Micro (2007)

The consumer price index says that the official price index for Internet access in the US went mildly down and up during the five years of dot-com boom and bust. It declined fiver percent over the next three years, between December 2002 and December 2005. Then just recently, it declined more than 18 percent from its base. What does the big drop mean? And how does the rise of broadband access, and the fall of dial-up, figure in?
Testing the significance of cell-cycle patterns in time-course microarray data using nonparametric quadratic inference functions
Authors: Guei-Feng Tsai, Annie Qu
Venue: Computational Statistics Data Analysis (2008)

We develop an approach to analyze time-course microarray data which are obtained from a single sample at multiple time points and to identify which genes are cell-cycle regulated. Since some genes have similar gene expression patterns, to reduce the amount of hypothesis testing, we first perform a clustering analysis to group genes into classes with similar cell-cycle patterns, including a class with no cell-cycle phenomena at all. Then we build a statistical model and an inference function assuming that genes within a cluster share the same mean model. A varying coefficient nonparametric approach is employed to be more flexible to fit the time-course data. In order to incorporate the correlation of longitudinal measurements, the quadratic inference function method is applied to obtain more efficient estimators and more powerful tests. Furthermore, this method allows us to perform chi-squared tests to determine whether certain genes are cell-cycle regulated. A data example on cell-cycle microarray data as well as simulations are illustrated.
An Efficient Intra Prediction Hardware Architecture for H.264 Video Decoding
Authors: Esra Sahin, Ilker Hamzaoglu
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In this paper, we present an efficient hardware architecture for real-time implementation of intra prediction algorithm used in H.264 / MPEG4 Part 10 video coding standard. The hardware design is based on a novel organization of the intra prediction equations. This hardware architecture is designed to be used as part of a H.264 video decoder for portable applications. The proposed architecture is implemented in Verilog HDL. The Verilog RTL is verified to work at 70 MHz in a Xilinx II FPGA. The FPGA implementation can process a VGA frame (640x480) in the worst case in 9.85 msec.
A CSP model of Eiffel&#x2019;s SCOOP
Authors: Phillip J. Brooke, Richard F. Paige, Jeremy L. Jacob
Venue: Formal Aspects of Computing (2007)

The current informal semantics of the simple concurrent object-oriented programming (SCOOP) mechanism for Eiffel is described. We construct and discuss a model using the process algebra CSP. This model gives a more formal semantics for SCOOP than existed previously. We implement the model mechanically via a new tool called CSPsim. We examine two semantic variations of SCOOP: when and how far to pass locks, and when to wait for child calls to complete. We provide evidence that waiting for child calls to complete both unnecessarily reduces parallelism without any increase in safety and increases deadlocks involving callbacks. Through the creation and analysis of the model, we identify a number of ambiguities relating to reservations and the underlying run-time system and propose means to resolve them.
The BEA/XQRL streaming XQuery processor
Authors: Daniela Florescu, Chris Hillery, Donald Kossmann, Paul Lucas, Fabio Riccardi, Till Westmann, Michael J. Carey, Arvind Sundararajan, Geetika Agrawal
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

In this paper, we describe the design, implementation, and performance characteristics of a complete, industrial-strength XQuery engine, the BEA streaming XQuery processor. The engine was designed to provide very high performance for message processing applications, i.e., for transforming XML data streams, and it is a central component of the 8.1 release of BEA's WebLogic Integration (WLI) product. This XQuery engine is fully compliant with the August 2002 draft of the W3C XML Query Language specification. A goal of this paper is to describe how an efficient, fully compliant XQuery engine can be built from a few relatively simple components and well-understood technologies.