ppxscal/embedding_network huggingface dataset:
Example based Super-Resolution Algorithm of Video in Contourlet Domain
Authors: Wei Ni, Baolong Guo, Liu Yang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

An example based super-resolution algorithm for digital video using contourlet transform is proposed in this paper. The input is a low resolution video sequence together with a high resolution still image of similar content. Firstly, the low resolution frames are interpolated to the same spatial resolution as the reference still image. For the good properties of directional, multiscale and anisotropy, the non-subsampled contourlet is utilized to create the training set of transform coefficient patches from the high resolution still image. Block based motion estimation is then applied inside the complete training set to find the best matching between interpolated frame and reference still image. According to the correspondence between low frequency and high frequency pairs, the missing high frequency information of the input frame can be easily learned from the training set. Finally, an inverse contourlet transformis applied to the interpolated frame and supplement high frequency subbands to recover the super-resolved image. Preliminary experimental results on video frames show that the proposed super-resolution algorithm outperforms conventional spatial interpolation methods and wavelet based interpolation algorithm both in visual quality and the PSNR value.
Translating PDDL Tasks into Multi-valued Conformant Planning Tasks
Authors: Jingjing Zhao, Jigui Sun, Minghao Yin
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In this paper, we formally define the problem of conformant planning with multi-valued state variables, namely multi-valued conformant planning task (MCPT), and present an algorithm for transforming conformant planning problems specified in planning domain definition language (PDDL) into MCPTs. The algorithm can deal with the uncertainties of initial conditions and disjunctive goals according to two important relaxed conditions.
A Semiring Privacy Protect Model
Authors: Zhang Mingwu, Yang Bo, Zhang Wenzheng
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Trust management systems support the provision of the required levels of assurance in a flexible and scalable manner by locally discriminating between the entities with which a principal should interact. However, there is a tension between the preservation of privacy and the controlled release of information when an entity submits credentials for establish and verify trust. In this paper, we propose a privacyprotecting trust model, which is based on an ordered semiring framework. In our semiring framework, the credential graph is flexible enough to express trust relationships and it also construct trust model based on privacy protect method. It gives a computing model to describe the trust opinion and privacy opinion, and also provides the minimized privacy disclosure credential search algorithm based on semiring model.
The Non-Death of Paper
Authors: Roy Lahr
Venue: IEEE Micro (1984)

The reports of the death of paper have been greatly exaggerated. Not only will computers not halt the flow of paper, they will probably increase it. 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
Introducing possibilistic logic in ILP for dealing with exceptions
Authors: Mathieu Serrurier, Henri Prade
Venue: Artificial Intelligence (2007)

In this paper we propose a new formalization of the inductive logic programming (ILP) problem for a better handling of exceptions. It is now encoded in first-order possibilistic logic. This allows us to handle exceptions by means of prioritized rules, thus taking lessons from non-monotonic reasoning. Indeed, in classical first-order logic, the exceptions of the rules that constitute a hypothesis accumulate and classifying an example in two different classes, even if one is the right one, is not correct. The possibilistic formalization provides a sound encoding of non-monotonic reasoning that copes with rules with exceptions and prevents an example to be classified in more than one class. The benefits of our approach with respect to the use of first-order decision lists are pointed out. The possibilistic logic view of ILP problem leads to an optimization problem at the algorithmic level. An algorithm based on simulated annealing that in one turn computes the set of rules together with their priority levels is proposed. The reported experiments show that the algorithm is competitive to standard ILP approaches on benchmark examples.
TopoICE-R
Authors: Isabel K. Darcy, Robert G. Scharein
Venue: Bioinformatics (2006)

TopoICE-R is a three-dimensional visualization and manipulation software for solving 2-string tangle equations and can be used to model the topology of DNA bound by proteins such as recombinases and topoisomerases. Availability: This software, manual and example files are available at for Linux, Windows and Mac. Contact: idarcy@math.uiowa.edu
New Hardware Realizations of Nonrecursive Digital Filters
Authors: S. Zohar
Venue: IEEE Transactions on Computers (1973)

Analysis of the bit-level operations involved in the convolution realizing a nonrecursive digital filter leads to hardware designs of digital filters based on the operation of counting.
Advances in Writer Identification and Verification
Authors: L. Schomaker
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

The behavioral-biometrics methods of writer identifica- tion and verification are currently enjoying renewed inter- est, with very promising results. This paper presents a gen- eral background and basis for handwriting biometrics. A range of current methods and applications is given. Re- sults on a number of methods are summarized and a more in-depth example of two combined approaches is presented. By combining textural, allographic and placement features, modern systems are starting to display useful performance levels. However, user acceptance will be largely determined by explainability of system results and the integration of sys- tem decisions within a (Bayesian) framework of reasoning that is currently becoming forensic practice.
Social Information Processing in News Aggregation
Authors: Kristina Lerman
Venue: IEEE Internet Computing (2007)

Social media sites underscore the Web's transformation to a participatory medium in which users collaboratively create, evaluate, and distribute information. Innovations in social media have led to social information processing, a new paradigm for interacting with data. The social news aggregator Digg exploits social information processing for the purpose of document recommendation and rating. Additionally, via mathematical modeling it's possible to describe how collaborative document rating emerges from the independent decisions users make. Using such a model, the author reproduces observed ratings that actual stories on Digg have received.
Lookaside Techniques for Minimum Circuit Memory Translators
Authors: W. C. Carter
Venue: IEEE Transactions on Computers (1973)

This paper demonstrates two improvements in coding techniques that could be used for memory word coding. First, within the fixed structure of a Hamming single-error-correcting, double-error-detecting (SEC/DED) code, an improvement can be obtained in circuit cost and operational speed over more conventional code implementations. Second, the mechanics of error correction in a fault-tolerant computer may be carried out via conventional hardware means or by use of the existing system facilities, such as the combination of the microprogram unit, local store, and the arithmetic-logic unit. These improvements may be obtained by the use of Rotational Coding schemes in conjunction with a technique calied "lookaside correction." This paper first shows a generalized algorithm for specifying the parity check matrix of Rotational Codes. The structure implemented by the parity check matrix in this paper is not merely encoding and decoding circuitry, but translates between Rotational Code forms and byte-parity encoded forms. The unique feature of these translators is that use of the Rotational Code permits the error correction to be performed on only a subset of the data word bits, and only if a single-error condition has been detected. The correction mechanism may be either a hardware logic circuit or firmware. The paper concludes with a comparison of the circuit requirements and correctional speed of the Hamming (72, 64) single-error-correcting, double-error-detecting code, as it normally would be implemented, and a Rotational Code translator also operating on 64 data bits and 8 check bits.
Motion of nonadmissible convex polygons by crystalline curvature
Authors: Shigetoshi Yazaki
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

Behavior of convex solution polygons to a general crystalline motion is investigated. A polygon is called admissible if the set of its normal angles equals that of the Wulff shape. We prove that if the initial polygon is not an admissible polygon, then all edges disappear simultaneously, or edge disappearing occurs at most finitely many instants and eventually a convex solution polygon becomes an admissible convex polygon. In the latter case, the normal angle of disappearing edge does not belong to the set of the normal angles of the Wulff shape. We also show five typical exmnples of this motion.
Investigation of IEEE 802.11k-based Access Point Coverage Area and Neighbor Discovery
Authors: S. D. Hermann, M. Emmelmann, O. Belaifa, A. Wolisz
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Possessing knowledge about access point coverage areas and neighbors is of essential need for the provisioning of, e.g., location based handovers or push services. A convenient method for their discovery is the usage of information obtained by the mobile devices which are currently associated with the access points. The time span being required for the discovery of coverage areas and neighbors is fundamental in order to assess the suitability of such a method in a dynamic environment. In this paper, exemplary numerical results of the required bootstrapping phase for the information determination are presented. Additionally, a relatively simple enhancement of the algorithm computing the coverage areas is introduced, reducing the number of vertices for the description of the areas. Besides, the paper shows how the upcoming IEEE 802.11k standard enables APs to query mobile devices for location and neighbor information and hence presents for the first time an entirely standard compliant acquisition scheme.
PID Neural Network Temperature Control System in Plastic Injecting-moulding Machine
Authors: Huailin Shu, Hua Shu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

PIDNN (proportional, integral and derivative neural network) was first created by the author in 1997[1]. In this paper, the author analyzes the characteristics of the temperature system of the plastic injecting-moulding machine and the performances of the PIDNN control system. The simulation results for the three-stage heater in a plastic injection machine are shown. It is proved that the PID neural network has perfect decoupling and self-learning control performances.
Real-Time Component Composition Using Hierarchical Timed Automata
Authors: Xianli Jin, Huadong Ma, Zonghua Gu
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

In component-based software development, it is important to use formal models to describe component composition. However, the existing component composition models generally ignore real-time issues. We present a formal integration model based on Hierarchical Timed Automata (HTA) for real-time software system. We present formal definition of components and different component composition techniques. We then introduce the notions of composable and compatible composition, and use Multiset Labeled Transition Systems to represent the interface actions of HTA to perform compositional verification. This hierarchical and unified framework establishes the foundation for formal analysis of real-time properties of the system. Key words: component, real-time, hierarchical timed automata, labeled transition systems
An Experiment on Unit Increase in Problem Complexity
Authors: S. N. Woodfield
Venue: IEEE Transactions on Software Engineering (1979)

The effect of a variation in problem complexity and how the variation relates to programming complexity is predicted and measured. An experiment was conducted in which eighteen graduate students programmed two variations of the same smali algorithm where the problem complexity varied by 25 percent. Eight measurable program characteristics are compared with predicted values obtained using only two known parameters. The agreement between observed and predicted values is very good. Both predicted and observed measurements indicate that the 25 percent increase in problem complexity results in a 100 percent increase in programming complexity.
Adaptive Resource Allocation and Scheduling for the Delay Limited OFDM Systems
Authors: Liexin Peng, Jian Du, Guangxi Zhu
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In the wireless networks, the power saving is highly important. The way of power saving by resource allocation and scheduling is attached more attention on recently. This paper explores optimal and suboptimal scheduling strategy for a multicarrier system over fading channels. The scheduling objective is to minimize the average system power under the delay constraint. Specifically, we study the trade-offs between the total transmit power of an orthogonal frequency division multiplexing (OFDM) system and the buffering delay of the packets in a transmission buffer. We formulate this optimization problem as a MDP and use dynamic programming techniques to obtain the optimal solution. Since finding the optimal policies becomes complex and practically un-realizable for large number of carriers in the system, we offer a suboptimal power allocation and bit loading algorithm using the results of the single carrier system and a greedy approach. Simulations show that the sub-optimal algorithm, which has reduced complexity, has performance close to the optimal one.
Knowledge Discovery in Signal Processing and Multi-media Color Image Segmentation Using Adaptive Mean Shift and Statistical Model-Based Method
Authors: Jonghyun Park, Lai Thi Anh, Gueesang Lee
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper presents an automatic segmentation approach for natural images based on adaptive mean shift and a statistical model-based approach. We employ the adaptive mean shift to determine the number of modes in a mixture model and to detect their components each mixture mode. We consider the use of the EM algorithm, combined with mean field annealing theory, for parameter estimation by Markov random field models from unlabelled data in the Gaussian mixture model (GMM). Lastly, the color images are segmented by using posterior probability of each pixel computed from the GMM. The experiment shows that the method can effectively and automatically segment natural images without specifying the number of initial components in GMM.
Microstructure and dielectric response of SrTiO3/NdGaO3 interdigitated capacitors
Authors: Satreerat K. Hodak, Charles T. Rogers
Venue: Microelectronic Engineering (2008)

Epitaxial strontium titanate (SrTiO"3 or STO) thin films were prepared by an off-axis pulsed laser deposition technique on neodymium gallate (NdGaO"3 or NGO) substrates held at temperature of 820^oC. This technique allows different film growth rates in a deposition. Coplanar capacitors were fabricated and dielectric responses were measured at 1MHz and at 2GHz, and from 300K to 4K. The electric field tunability of the dielectric constant and loss tangent were taken with a range of electric field. The structure and morphology of the films were analyzed using high-resolution X-ray diffractometry and atomic force microscopy, respectively. The results showed that the films are crystalline with (100) orientation and the grains are columnar. Increased in-plane grain size and reduced surface to volume ratio were found to play a major role in improved performance of the film coplanar capacitors. The film with the growth rate of approximate 40A/min showed the highest change in the dielectric constant with an electric field of 4V/@mm. The film also showed the largest in-plane grain size of about 3000A.
Price of Structured Routing and Its Mitigation in P2P Systems under Churn
Authors: Joseph S. Kong, Vwani P. Roychowdhury
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

We study the resilience of structured peer-to-peer (P2P) networks in the presence of churn. Using the lifetime-based failure assumptions, we first show that a realistic churn model has an equivalent uniform failure model in the steady state. We then determine via percolation analysis and simu- lation the gap between the size of the connected component and the reachable component of a randomly picked node for Symphony and Chord. This gap represents the price of structured routing: the size of the set of nodes that are reachable by any unstructured routing method (e.g. broad- cast on the unstructured overlay) from a randomly picked surviving node, but are not reachable using structured rout- ing on the structured overlay. As an illustration, for 24- minute average node lifetime with 1-minute average node- search delay, the gap is around 12 thousand nodes or 1.2% in a Chord network of around 1 million nodes. We finish by discussing potential techniques to mitigate the price of structured routing.
Trace Compaction using SAT-based Reachability Analysis
Authors: Sean Safarpour, Andreas Veneris, Hratch Mangassarian
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In today's designs, when functional verification fails, engineers perform debugging using the provided error traces. Reducing the length of error traces can help the debugging task by decreasing the number of variables and clock cycles that must be considered. We propose a novel trace length compaction approach based on SAT-based reachability analysis. We develop procedures and algorithms using pre-image computation to efficiently traverse the state space and reduce the trace lengths. We further introduce a data structure used to store the visited states which is critical to the performance of the proposed approach. Experiments demonstrate the effectiveness of the reachability approach as approximately 75% of the traces are reduced by one or two orders of magnitudes.
A Methodology for the Design of Ada Transformation Tools in a DIANA Environment
Authors: D. S. Rosenblum
Venue: IEEE Software (1985)

Implementing and testing transformations incrementally makes DIANA-based Ada software tools easier to debug and more efficient.
Amdahl's law revisited for single chip systems
Authors: JoAnn M. Paul, Brett H. Meyer
Venue: International Journal of Parallel Programming (2007)

Amdahl's Law is based upon two assumptions - that of boundlessness and homogeneity - and so it can fail when applied to single chip heterogeneous multiprocessor designs, and even microarchitecture. We show that a performance increase in one part of the system can negatively impact the overall performance of the system, in direct contradiction to the way Amdahl's Law is instructed. Fundamental assumptions that are consistent with Amdahl's Law are a heavily ingrained part of our computing design culture, for research as well as design. This paper points in a new direction. We motivate that emphasis should be made on holistic, system level views instead of divide and conquer approaches. This, in turn, has relevance to the potential impacts of custom processors, system-level scheduling strategies and the way systems are partitioned. We realize that Amdahl's Law is one of the few, fundamental laws of computing. However, its very power is in its simplicity. and if that simplicity is carried over to future systems, we believe that it will impede the potential of future computing systems.
Advanced tools for simulation and design of oscillators/PLLs
Authors: Xiaolue Lai, J. Roychowdhury
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

We present a robust, automated oscillator macromodeling technique for extracting comprehensive phase and amplitude macromodels from oscillators' SPICE circuit descriptions. The macromodels are able to correctly predict oscillator response in the presence of interference at far lower computational cost than that of full SPICE-level simulation, while retaining the simulation accuracy. We find many applications for the proposed macromodeling technique, which include injection locking prediction, fast simulation of coupled oscillating systems, and fast PLL transient simulation and jitter analysis. We demonstrate the applications on some oscillator-based systems, and compare results against full SPICE-level simulation. Experimental results show that the macromodels capture the behavior of the oscillator systems accurately, and provide speedups of over three orders of magnitude.
Variation-Tolerant, Power-Safe Pattern Generation
Authors: V. R. Devanathan, C. P. Ravikumar, V. Kamakoti
Venue: IEEE Design Test (2007)

Modern SoC devices use elaborate power management strategies in functional mode, because not all IP blocks can be functional at the same time. Cost considerations often do not permit overdesigning the power supply infrastructure for test mode or using expensive flip-chip packaging to avoid the problem. Test application must not overexercise the power supply grids, lest the tests damage the device or lead to false test failures. The problem of debugging a delay test failure can therefore be highly complex. The problem is aggravated by on-chip variations in technologies below 100 nm. However, it's possible to avoid false delay test failures by generating safe patterns that are tolerant to on-chip variations. The authors propose a framework for power-safe pattern generation that uses power grid information and regional constraints on switching activity. Experimental results with benchmark circuits demonstrate the effectiveness of this framework.
Deriving Symbol Dependent Edit Weights for Text Correction_The Use of Error Dictionaries
Authors: Ch. Ringlstetter, U. Reffle, A. Gotscharek, K. Schulz
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Most systems for correcting errors in texts make use of specific word distance measures such as the Levenshtein distance. In many experiments it has been shown that correction accuracy is improved when using edit weights that depend on the particular symbols of the edit opera- tion. However, most proposed approaches so far rely on high amounts of training data where errors and their cor- rections are collected. In practice, the preparation of suit- able ground truth data is often too costly, which means that uniform edit costs are used. In this paper we evaluate ap- proaches for deriving symbol dependent edit weights that do not need any ground truth training data, comparing them with methods based on ground truth training. We suggest a new approach where special error dictionaries are used to estimate weights. The method is simple and very efficient, needing one pass of the document to be corrected. Our ex- periments with different OCR systems and textual data show that the method consistently improves correction accuracy in a significant way, often leading to results comparable to those achieved with ground truth training.