ppxscal/embedding_network huggingface dataset:
A soft computing model for mapping incomplete/approximate postal addresses to mail delivery points
Authors: P. Nagabhushan, S. A. Angadi, B. S. Anami
Venue: Applied Soft Computing (2009)

Mapping of postal address to a mail delivery point is a very important task that affects the efficiency of postal service. This task is very complex in the countries such as India, where postal addresses are not structured. Further most of the times the destination addresses in such countries are incomplete, approximate and erroneous which adds to the complexity of mapping postal address to delivery point. Automation of this aspect of the postal service is a challenge. This paper presents a soft computing model to map the postal address to mail delivery point. Firstly machine readable postal address is processed to identify the address components using a novel fuzzy symbolic similarity analysis, and further these labeled components are organized as a symbolic postal address object. This postal address object is further processed using the newly devised fuzzy symbolic methodology for mapping the address to mail delivery point. Symbolic knowledge bases for postal address component labeling and mail delivery point mapping are devised. Fuzzy symbolic similarity measures are formulated once for address component labeling and the second time for mapping the entire address to a mail delivery point. In sequel to similarity computations, which are viewed as fuzzy membership values, an expert system comprising of @a-cut de-fuzzification is proposed to evaluate the confidence factors, while inferencing the validity of address component labels and mail delivery points. The system is tested exhaustively and an efficiency of 94% is obtained in address component identification and about 86% in mail delivery point mapping, while working on an Indian postal data base of about 500 addresses.
A lossy 3D wavelet transform for high-quality compression of medical video
Authors: Gregorio Bernabé, Jose M. García, José González
Venue: Journal of Systems and Software (2009)

In this paper, we present a lossy compression scheme based on the application of the 3D fast wavelet transform to code medical video. This type of video has special features, such as its representation in gray scale, its very few interframe variations, and the quality requirements of the reconstructed images. These characteristics as well as the social impact of the desired applications demand a design and implementation of coding schemes especially oriented to exploit them. We analyze different parameters of the codification process, such as the utilization of different wavelets functions, the number of steps the wavelet function is applied to, the way the thresholds are chosen, and the selected methods in the quantization and entropy encoder. In order to enhance our original encoder, we propose several improvements in the entropy encoder: 3D-conscious run-length, hexadecimal coding and the application of arithmetic coding instead of Huffman. Our coder achieves a good trade-off between compression ratio and quality of the reconstructed video. We have also compared our scheme with MPEG-2 and EZW, obtaining better compression ratios up to 119% and 46%, respectively for the same PSNR.
High Performance Processor Chips
Authors: Maurice V. Wilkes
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

The development during the last 15 years in single-chip computers has been striking. It is a development that I have followed in detail, and some of you may have heard me talk about it before. It started in 1989 when a desktop computer first outperformed the most powerful minicomputer on the market, namely the VAX 8600. The desktop computer in question was a workstation based on a processor chip developed and marketed by the MIPS Computer Company, of which Professor John Hennessy of Stanford University was a leading light. Subsequent developments were very rapid and led to the demise of the minicomputer as we used to know it and to love it.
Reward oriented packet filtering algorithm for wireless sensor networks
Authors: Lei Shu, Jie Yang, Lin Zhang, Hui Xu, Xiaoling Wu, Manfred Hauswirth
Venue: Wireless Communications Mobile Computing (2009)

Packet filtering used in query process is an important approach to reduce energy consumption in sensor networks. Interest is used as a constraint to filter uninterested data when users query information. Within interested data some are more important because they have more valuable information than that of others. We hope to process these more important data first. In this paper, we firstly define reward to denote the importance level of data, and then we present a two tiers buffer model as the platform for our ETRI packet filtering algorithm. We especially present two packet filtering algorithms for real time and non-real time transmissions. Based on simulation result, we find out that both packet filtering algorithms can substantially improve the quality of information and reduce energy consumption. Copyright &copy; 2007 John Wiley & Sons, Ltd. This work was partially accomplished when Lei Shu was studying as a graduate student at the Ubiquitous Computing Laboratory in Kyung Hee University.
Determination and analysis of a standard interface model derived from a medium speed line printer
Authors: Gary E. Jones
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The need for the development of a standard interface for computer associated equipment is a subject that requires investigation based on analytical facts rather than emotion. To establish a baseline for the definition of an interface model, a medium speed line printer utilizing 22 interfaces for a given printer model provides adequate interfaces for investigation. Such a model has many similarities relative to any interface consideration. All data presented is factual and represents an actual functioning interface to a controller. Most interfaces are associated with terminals, minicomputer or medium scale computers. 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
Energy-aware register file re-partitioning for clustered VLIW architectures
Authors: Yingchao Zhao, Chun Jason Xue, Minming Li, Bessie Hu
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

VLIW architectures have gained acceptance in embedded systems. Traditional monolithic register file is not suitable for VLIW architectures with a large number of functional units. Clustered VLIW architecture is often applied, where the register file is partitioned into a number of smaller regeister files. Register files represent a substantial portion of the energy consumption in modern processors, and it is growing rapidly with wider instruction width. Most of the known clustered VLIW architectures partition the register file evenly among clusters. In this paper, we study the effect of energy consumption with register file re-partitioning on clustered VLIW architecture, where register files are not necessarily partitioned evenly. We present algorithms to compute energy-efficient re-partition of register files under different conditions. The impact of different intercluster communication models as well as the impact of program behavior on the register file re-partitioning are analyzed in this paper. Experimental results show that energy saving can be achieved using the proposed techniques.
Copower functors
Authors: H. Peter Gumm
Venue: Theoretical Computer Science (2009)

We give a common generalization of two earlier constructions in [H.P. Gumm, T. Schroder, Monoid-labeled transition systems, Electronic Notes in Theoretical Computer Science 44 (1) (2001) 184-203], that yielded coalgebraic type functors for weighted, resp. fuzzy transition systems. Transition labels for these systems were drawn from a commutative monoid M or a complete semilattice L, with the transition structure interacting with the algebraic structure on the labels. Here, we show that those earlier signature functors are in fact instances of a more general construction, provided by the so-called copower functor. Exemplary, we instantiate this functor in categories given by varieties V of algebras. In particular, for the variety S of all semigroups, or the variety M of all (not necessarily commutative) monoids, and with M any monoid, we find that the resulting copower functors M"S[-] (resp M"M[-]) weakly preserve pullbacks if and only if M is equidivisible (resp. conical and equidivisible). Finally, we show that copower functors are universal in the sense that every faithful Set-functor can be seen as an instance of an appropriate copower functor.
Modeling information-seeker satisfaction in community question answering
Authors: Eugene Agichtein, Yandong Liu, Jiang Bian
Venue: ACM Transactions on Knowledge Discovery from Data (TKDD) (2009)

Question Answering Communities such as Naver, Baidu Knows, and Yahoo&excl; Answers have emerged as popular, and often effective, means of information seeking on the web. By posting questions for other participants to answer, information seekers can obtain specific answers to their questions. Users of CQA portals have already contributed millions of questions, and received hundreds of millions of answers from other participants. However, CQA is not always effective: in some cases, a user may obtain a perfect answer within minutes, and in others it may require hours&mdash;and sometimes days&mdash;until a satisfactory answer is contributed. We investigate the problem of predicting information seeker satisfaction in collaborative question answering communities, where we attempt to predict whether a question author will be satisfied with the answers submitted by the community participants. We present a general prediction model, and develop a variety of content, structure, and community-focused features for this task. Our experimental results, obtained from a large-scale evaluation over thousands of real questions and user ratings, demonstrate the feasibility of modeling and predicting asker satisfaction. We complement our results with a thorough investigation of the interactions and information seeking patterns in question answering communities that correlate with information seeker satisfaction. We also explore personalized models of asker satisfaction, and show that when sufficient interaction history exists, personalization can significantly improve prediction accuracy over a &ldquo;one-size-fits-all&rdquo; model. Our models and predictions could be useful for a variety of applications, such as user intent inference, answer ranking, interface design, and query suggestion and routing.
Flexible spectrum and future business models for the mobile industry
Authors: Pieter Ballon, Simon Delaere
Venue: Telematics and Informatics (2009)

The concept of flexible spectrum is often considered as a medium-to-long-term solution to overcome some of the current inefficiencies and high entry barriers plaguing the mobile industry. Increasingly, a cognitive pilot channel (CPC) is regarded as a central enabler for flexible spectrum. This paper outlines the CPC concept from a business point of view and clarifies its current status in the standardization and regulation fields. The idea of a worldwide CPC will be under consideration by the World Radio Conference in 2011. Based on several potential CPC implementations, the paper identifies a number of flexible spectrum business configurations and revenue sharing models. It also performs an initial forward-looking evaluation of these models using a business model scorecard approach, and finds that while the scope appears to be limited for a fully competitive, cross-operator spectrum market, several platform models (e.g. association or consortium models) stand out as feasible options.
A Greedy-but-Safe Dynamic Scheduling Strategy for an Interactive Video-On-Demand Server
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

In this paper, we study a dynamic approach to the problem of scheduling real-time requests in a Video-On-Demand server. Most of the previous VOD scheduling approaches use limited run-time information, and thus cannot exploit the potential capacity fully. Our approach improves throughput by making use of run-time information to relax admission control, and to reduce admission-to-start delay by providing earliest initial service. We establish conditions for greedy admission, dynamic control of the sequence and sizes of disk accesses, and fast initial service. We conduct thorough simulations over a wide range of buffer capacities, load settings, and over varying playout rates to demonstrate the significant improvements in throughput and admission-to-start delay of our approach relative to a typical static approach which does not use run-time information. 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
iTunes University and the classroom: Can podcasts replace Professors?
Authors: Dani McKinney, Jennifer L. Dyck, Elise S. Luber
Venue: Computers Education (2009)

iTunes University, a website with downloadable educational podcasts, can provide students the opportunity to obtain professors' lectures when students are unable to attend class. To determine the effectiveness of audio lectures in higher education, undergraduate general psychology students participated in one of two conditions. In the lecture condition, participants listened to a 25-min lecture given in person by a professor using PowerPoint slides. Copies of the slides were given to aid note-taking. In the podcast condition, participants received a podcast of the same lecture along with the PowerPoint handouts. Participants in both conditions were instructed to keep a running log of study time and activities used in preparing for an exam. One week from the initial session students returned to take an exam on lecture content. Results indicated that students in the podcast condition who took notes while listening to the podcast scored significantly higher than the lecture condition. The impact of mobile learning on classroom performance is discussed.
First Steps Towards a Wet Implementation for τ-DPP
Authors: Dario Pescini, Paolo Cazzaniga, Claudio Ferretti, Giancarlo Mauri
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

In the last decade, different computing paradigms and devices inspired by biological and biochemical systems have been proposed. Here, we recall the notions of membrane systems and the variant of &tau;-DPP. We introduce the framework of chemical computing, in order to show how to describe computations by means of a chemical reaction system. Besides the usual encoding of primitive Boolean functions, we also present encodings for register machines instructions. Finally will discuss how this computing components can be composed in a more complex chemical computing system, with a structure based on the membrane structure of &tau;-DPP, to move toward a wet implementation using the micro reactors technology.
Designated-Verifier Chameleon Proxy Signature
Authors: Jianhong Zhang, Cheng Ji, Qin Geng
Venue: International Journal of Distributed Sensor Networks (2009)

With the development of computer technology, the requirement of the methods to verify the authenticity, the validity, and the integrity of information is becoming much bigger. For this purpose, many methods have been generated, such as digital signature, digital watermarking, steganography, and so on. Digital signature is a hot topic in cryptography and it plays a very important role in many fields. A normal digital signature allows a signer to generate a signature of the message with his secret key and the generated signature can be verified by anyone with the signer's public key. Chameleon signature is a non-interactive signature based on the well-established hash-and-sign paradigm, in which the receiver cannot convince the third party of the identity of the signer. Designated-verifier signature is a very useful tool for protecting the privacy of the valid verifier. Motivated by above statements, we construct a new chameleon hash scheme and construct a new DVICPS scheme. Our chameleon hash scheme satisfies all the properties of the normal chameleon hash function. In our hash function the owner of a public key does not need to retrieve the associated secret key. We prove that our new chameleon hash scheme satisfies all the attributes defined in [1] and our chameleon hash scheme is secure assuming Weak Computational Diffie-Hellman (WCDH) assumption is difficult. And we show our chameleon hash scheme is secure based on the difficulty of solving WCDHP assumption. Moreover, we use the proposed chameleon hash function to design a designated-verifier ID-based chameleon proxy signature (DVICPS) scheme. Furthermore, we analyze the security of our DVICPS scheme and prove that our DVICPS scheme is secure in the random oracle model. In our signature scheme, only the receiver who owns the corresponding secret key can verify the validity of the signature which efficiently protects the benefit of the verifier. We also prove that our signature scheme is secure in random oracle model. The success probability of forging our DVICPS scheme is equivalent to solving Computational Diffie-Hellman Problem (CDHP). Thus, our DVICPS scheme is secure and efficient.
Comparative Analysis on Transform and Reconstruction of Compressed Sensing in Sensor Networks
Authors: Di Guo, Xiaobo Qu, Mingbo Xiao, Yan Yao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Compressed sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for reconstruction. It holds valuable implications for wireless sensor networks because power and bandwidth are limited resources. In this paper, applying the theory of compressed sensing to the practical sensor network data recovery problem, we compare the performance of different CS reconstruction algorithms combined with wavelet and discrete cosine transform (DCT) basis. We demonstrate empirically that DCT is good for sinusoid oscillatory data while wavelet is good for data with point-like singularities. Furthermore, comparison on reconstruction algorithms shows basis pursuit (BP) is best in term of PSNR performance and computing time. In addition, benefit of CS for noisy channel of sensor network is tested and how to achieve good performance in noisy channel is discussed.
A 1.2v, 1.02 ghz 8 bit SIMD compatible highly parallel arithmetic data path for multi-precision arithmetic
Authors: Sohan Purohit, Sai Rahul Chalamalasetti, Martin Margala
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Coarse grained arithmetic and logic units have long been the primary computational units for media processing. This paper presents the organization and VLSI implementation of a new 8bit, Single Instruction Multiple Data (SIMD) compatible ALU for fast, area and power efficient arithmetic and logic operations. An array of 8 such units, along with the interconnect network to perform 16 bit multiplication is shown. The array was custom implemented in IBM 0.13 CMOS process. Post layout simulation results show cell operation at 1.02GHz with a power consumption of 1.34mW. The proposed cell consumes 22-52% less power than competing architectures, while providing GHz range operating speeds. The array is found to provide almost 6 times the performance of dedicated 16 bit multiplication units, while still providing 60% power improvement. A generalized mapping scheme for implementing higher precision arithmetic operations using the proposed ALU as the basic building block is shown.
Node isolation model and age-based neighbor selection in unstructured P2P networks
Authors: Zhongmei Yao, Xiaoming Wang, Derek Leonard, Dmitri Loguinov
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Previous analytical studies of unstructured P2P resilience have assumed exponential user lifetimes and only con-sidered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-se-lection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared with uniform selection of neighbors. In fact, the second strategy based on random walks on age-proportional graphs demonstrates that, for lifetimes with infinite variance, the system monotonically increases its resilience as its age and size grow. Specifically, we show that the probability of isolation converges to zero as these two metrics tend to infinity. We finish the paper with simulations in finite-size graphs that demonstrate the effect of this result in practice.
SID: a system for interactive design
Authors: Tosiyasu L. Kunii, Minoru Harada
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

A System for Interactive Design (SID) is a computer-aided visual facility for hierarchical (or recursive) design of complex systems. SID is built as a provision to make the potential of our graph theoretical design tool RGF (the recursive graph formalism) actually available to system designers. RGF, as we initially proposed in 1978, aimed at providing a logical basis for interactive design evolution from global to detailed, and/or from simple to complex. RGF was actually applied to designs of hospital information systems and petrochemical plants, and was proven useful for logically detecting and preventing human design errors and for computer-aided design evolution. SID includes the capabilities of SARA of UCLA and SADT of SofTech which are known as the system specification methodologies based on hierarchically structured graphs. Related works using similar graphs in other areas are H-graphs in language and automata theory, and DRLH in artificial intelligence.
Blind identification of multi-channel systems with single input and unknown orders
Authors: Issa M. S. Panahi, Kripasagar Venkat
Venue: Signal Processing (2009)

In commonly used SOS-based methods for blind identification of single input multiple output (SIMO) systems, such as subspace (SS) and least squares (LS), the highest order of unknown FIR channels is assumed to be known or is overestimated. In this paper we propose a new method based on modified Levinson algorithm (MLA) that makes no such assumptions. This method determines which FIR channel is minimum-phase, and estimates every channel impulse response with correct order when at least one of the unknown FIR channels is invertible. We first develop a MLA-based method for estimating a LTI SISO stable IIR system of correct orders when the input is an arbitrary stationary signal. We then use the results of such method and propose a solution to the SIMO blind system identification problem when orders of FIR channels are unknown. Performance of the proposed method is compared with those of the SS and power of R (POR) methods using different signal to noise ratio.