ppxscal/embedding_network huggingface dataset:
Modeling and verification of dsp designs in hol
Authors: Behzad Akbarpour
Venue:  (2005)

In this thesis we propose a framework for the incorporation of formal methods in the design flow of DSP (Digital Signal Processing) systems in a rigorous way. In the proposed approach we model and verify DSP descriptions at different abstraction levels using higher-order logic based on the HOL (Higher Order Logic) theorem prover. This framework enables the formal verification of DSP designs which in the past could only be done partially using conventional simulation techniques. To this end, we provide a shallow embedding of DSP descriptions in HOL at the floating-point, fixed-point, behavioral, RTL (Register Transfer Level), and netlist gate levels. We make use of existing formalization of floating-point theory in HOL and introduce a parallel one for fixed-point arithmetic. The high ability of abstraction in HOL allows a seamless hierarchical verification encompassing the whole DSP design path, starting from top level floating- and fixed-point algorithmic descriptions down to RTL, and gate level implementations. We illustrate the new verification framework using different case studies such as digital filters and FFT (Fast Fourier Transform) algorithms.
PL/I process generators
Authors: Y. V. Reddy
Venue: ACM SIGSIM Simulation Digest (1975)

The following is a listing of several process generators implemented in PL/I. These were adopted from similar programs implemented in SIMSCRIPT II and published in the SIMSCRIPT II implementation manual. The Assembly Language version of the pseudo random number generator was adopted from a listing published in CACM, Feb. 1969. All programs raise a CONDITION (@ERR), if improper arguments are passed. The error conditions and the calling arguments are self explanatory. These routines allow for ten separate streams of random numbers. The seed values are initialized in the routine RANDOM.
Object-oriented cohesion as a surrogate of software comprehension: an empirical study
Authors: Steve Counsell, Stephen Swift, Allan Tucker
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

The concept of software cohesion in both the procedural and object-oriented paradigm is well known and documented. What is not so well known or documented is the perception of what empirically constitutes a cohesive ¿unit¿ by software engineers. In this paper, we describe an empirical investigation using object-oriented (OO) classes as a basis. Twentyfour subjects (drawn from IT experienced and IT inexperienced groups) were asked to rate ten classes sampled from two industrial systems in terms of their overall cohesiveness; a class environment was used to carry out the study. Four key results were observed. Firstly, class size (when expressed in terms of number of methods) did not tend to influence the perception of cohesion by any subjects. Secondly, well-commented classes were rated most highly amongst both IT experienced and inexperienced subjects. Thirdly, the empirical study suggests that cohesion comprises a combination of various class factors including low coupling, small numbers of attributes and wellcommented methods, rather than any single, individual class feature per se. Finally, the research supports the view that cohesion is a subjective concept reflecting a cognitive combination of class features; as such it is a surrogate for class comprehension.
Evaluating personal information management behaviors and tools
Authors: Diane Kelly
Venue: Communications of the ACM (2006)

How to study and understand the idiosyncratic PIM behaviors we exhibit naturally at home, at work, and in between, in the interests of developing future PIM tools.
Gabor Filter Bank Representation for 3D Face Recognition
Authors: Jamie Cook, Vinod Chandran, Sridha Sridharan, Clinton Fookes
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

In this paper an investigation of the validity of Gabor filter banks for feature extraction in a face recognition context is presented. Using the combined 2D/3D database collected by the Computer Vision Laboratory at the University of Notre Dame and the Colorado State University's implementation of the Eigenfaces method, a comprehensive evaluation of the Log-Gabor filter bank representation is performed. Analysis of both the spatial and frequency domains is conducted to evaluate the distribution of discriminatory information.
Web Community Discovery Using Personal Names
Authors: Kazuhiro Kazama, Osamu Katai, Shin-ya Sato, Hiroshi Kawakami
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

These days, web access is essential for our daily lives, and many communities are formed by the exchange of information. We propose a method for discovering web communities by using personal names. It extracts personal names fromsearch results that are relevant to a speci fic topic and finds appropriate web communities by analyzing the bipartite graph between personal names and websites. In general, web pages are too noisy to extract such social network structures automatically. We introduce a measure called effectiveness and extract only key people or key websites to make their bipartite graph. We also demonstrate an application called "Community Navigator" and visualize web communities for a specific topic by using it. Moreover, we analyze the measure for an actual example and show that it is suitable for selecting key people and key websites.
Magellan: Performance-based, Cooperative Multicast
Authors: Stefan Birrer, Fabian E. Bustamante
Venue: Proceedings of the 10th International Workshop on Web Content Caching and Distribution (2005)

Among the proposed overlay multicast protocols, treebased systems have proven to be highly scalable and effi- cient in terms of physical link stress and end-to-end latency. Conventional tree-based protocols, however, distribute the forwarding load unevenly among the participating peers. An effective approach for addressing this problem is to stripe the multicast content across a forest of disjoint trees, evenly sharing the forwarding responsibility among participants. DHTs seem to be naturally well suited for the task, as they are able to leverage the inherent properties of their routing model in building such a forest. In heterogeneous environments, though, DHT-based schemes for tree (and forest) construction may yield deep, unbalanced structures with potentially large delivery latencies. This paper introduces Magellan, a new overlay multicast protocol we have built to explore the tradeoff between fairness and performance in these environments. Magellan builds a data-distribution forest out of multiple performance-centric, balanced trees. It assigns every peer in the system a primary tree with priority over the peer¿s resources. The peers¿ spare resources are then made available to secondary trees. In this manner, Magellan achieves fairness, ensuring that every participating peer contributes resources to the system. By employing a balanced distribution tree with O(lgN)-bounded, end-to-end hop-distance, Magellan also provides high delivery ratio with comparable low latency. Preliminary simulation results show the advantage of this approach.
Parsing with a finite dictionary
Authors: Julien Clément, Jean-Pierre Duval, Giovanna Guaiana, Dominique Perrin, Giuseppina Rindone
Venue: Theoretical Computer Science (2005)

We address the following issue: given a word w ∈ A* and a set of n nonempty words X, how does one determine efficiently whether w ∈ X* or not? We discuss several methods including an O(r × |w| + |X|) algorithm for this problem where r ≤ n is the length of a longest suffix chain of X and |X| is the sum of the lengths of words in X. We also consider the more general problem of providing all the decompositions of w in words of X.
Design and Evaluation of a High Performance Parallel File System
Authors: Li Ou, Xubin (Ben) He
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In this paper we propose a high performance parallel file system over iSCSI (iPVFS) for cluster computing. iPVFS provides a cost-effective solution for heterogeneous cluster environment by dividing a set of I/O servers into two groups, one group with higher performance servers as I/O nodes, while another group with relatively lower performance machines serves as storage target nodes. This combination provides a higher aggregate performance because of the cooperative cache among different target nodes. We have developed a model to analyze iPVFS. Our simulation results show that using same number of total nodes, iPVFS outperforms PVFS for both small requests and large requests under different workloads.
Supporting Low-Cost Video-on-Demand in Heterogeneous Peer-to-Peer Networks
Authors: Xin Liu, Son T. Vuong
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

We propose a novel low-cost video-on-demand architecture for heterogeneous peer-to-peer networks. The key idea of this architecture is to aggregate peers' storage and bandwidths to facilitate on-demand video streaming. To achieve this goal, we split published videos into segments and distribute them to different peers. When watching a video, a peer searches the corresponding segments, and then aggregates bandwidths from multiple supplying peers to stream the video. Instead of relying on the powerful servers/proxies, this architecture exploits the oftenunderutilized peers' resources, which makes it costeffective. We demonstrate the effectiveness of this proposed architecture through extensive simulation experiments on large, Internet-like topologies.
Use of ferroelectric gate insulator for thin film transistors with ITO channel
Authors: E. Tokumitsu, M. Senoo, T. Miyasako
Venue: Microelectronic Engineering (2005)

Typical n-channel transistor characteristics with nonvolatile memory operation of ferroelectric-gate thin film transistors (TFTs) using indium-tin-oxide (ITO) channel have been demonstrated. It is shown that relatively large "on" current can be obtained in ITO/(Bi,La)4Ti3O 12(BLT) TFTs. Since the calculated field-effect mobility is as small as 4 cm2/Vs, the large "on" current is due to the large charge density induced by the ferroelectric gate insulator. It is also shown that the thin conductive ITO channel can be depleted completely by the ferroelectric polarization and "off' current of the device is as low as 10-7 A. Drain current - gate voltage characteristics exhibit counterclockwise hysteresis due to the ferroelectric nature of the gate insulator, which demonstrates nonvolatile memory operation. The memory window is approximately 4 V, which agrees with the theoretical calculation. In addition, no change in both "on" and "off" currents has been observed up to 103 s.
Pose Angle Determination by Face, Eyes and Nose Localization
Authors: P. Sankaran, S. Gundimada, R. C. Tompkins, V. K. Asari
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

FRGC aims to develop algorithms that make use of the high quality images in the face database. The algorithms in this paper have been developed with this in view. We present methods to estimate pose using multi-view classifiers. Based on the knowledge of pose and face geometry a region of interest of possible eye locations is found. An adaptive thresholding is used to pick out the darkest pixels in this region, which forms the eye region. Using this information region of interest of nose location is formed. A gradient operator is used to obtain the edges in this region. Histogram thresholding is used to find the nose in this region. Lines are drawn joining the center points of each of the regions. Perpendicular is drawn to the line joining the eye centers. Based on the slopes of these lines the pose angle is determined. The FRGC version 2 experiment number 4 image set is used to test the eye location algorithm while the nose location and pose angle methods are tested on version 1 image set.
Critical Points of the Singular Value Decomposition
Authors: Kevin A. O'Neil
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

The singular value decomposition (SVD) is a factorization that is discontinuous on the subset of matrices having repeated singular values. In this paper the SVD is studied in the vicinity of this critical set. Each one-parameter $C^k$ perturbation transversal to the critical set is shown to uniquely determine an SVD at the critical point that extends to an SVD along the perturbation path that is $C^{k-1}$ in the perturbation parameter. Derivatives of the singular vectors at the critical point are found explicitly. Application is made to the effect on the singular vectors of perturbations from a matrix in the critical set and compared to the information provided by the $\sin (\theta)$ theorem. Estimates of the derivative of the singular vectors are applied to inequalities involving the matrix absolute value, such as the generalized Araki--Yamagami inequality.
Error Resilience Schemes of H.264/AVC for 3G Conversational Video Services
Authors: Lin Liu, Sanyuan Zhang, Xiuzi Ye, Yin Zhang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

The emerging of third generation mobile system (3G) makes conversational video transmission in wireless environment possible, and the latest 3GPP/3GPP2 standards suggest 3G terminals support H.264/AVC. Due to high bit error rate in wireless environment, error resilience schemes are necessary for 3G terminals. Moreover, according to 3GPP/3GPP2, 3G terminals support only part of error resilience tools of H.264/AVC. This paper lists various error resilience tools and analyzes their usability in 3G environment, and at the same time, some error resilience schemes are proposed. Performances of these error resilience schemes are tested using off-line common test conditions. Experiments shows that, in 3G environment, encoding with simple FMO mode and extra intra block refreshing can achieve the best error correction ability, because this method can make full use of spatial correlation for intra predication and reduce the requirement of bit rate
Changeability of Web Objects - Browser Perspective
Authors: Andrzej Sieminski
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

The paper examines the usefulness of the browser cache for studying the properties of WEB objects. The cache contains detailed, personalized data on a user interaction with the WEB during the period covering a few previous weeks. The data could be used for a variety of purposes including adaptive systems but the paper concentrates on the objects' changeability. Precise knowledge about the scope and nature of the changeability enables us to estimate the upper limit of caching efficiency, no matter what algorithms are used. Caching reduces both the volume of the traffic and the perceived latency. The paper discusses the results of an experiment and suggests other areas in which the data extracted from the local Internet buffer may be useful.
Concordance, conformance, versions, and traceability
Authors: Ethan V. Munson, Tien N. Nguyen
Venue: Proceedings of the 3rd international workshop on Traceability in emerging forms of software engineering (2005)

Since its inception in 1999, the Software Concordance Project has studied problems in software traceability [5]. Our research has been based on four principles:1. That effective traceability analysis must address the full range of documents produced by the software development process;2. That, for the foreseeable future, a large proportion of software documents will be written in natural languages, such as informal text or various types of diagrams, and that fully automated analysis of these documents will not be tractable;3. That traceability practices will only improve when developers have tools that substantially reduce the effort required to maintain traceability information; and4. That structured document and hypermedia technology is a good basis for traceability support in integrated development environments.
On Building a Reflective Middleware Service for Location-Awareness
Authors: Uzair Ahmad, Uzma Nasir, Mahrin Iqbal, Young Koo Lee, Sung Young Lee, Inook Hwang
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Location based services are becoming essential feature of context-awareness in ubiquitous computing. Reflective distribute component programming model is proposed to systematically provide location to Location Based Services (LBS). We integrate distributed component technology and reflection to develop localization capability as middleware service. Concept of Meta Object Protocols (Reflection) is used in different way than traditional reflective mechanisms. It deals with the state of the component that is not inside the component rather resides outside of it, namely extrinsic. This component model provides the basis for middleware architecture to support location providing service at design, implementation and run time. We describe the methodology we used to build location-awareness as middleware service based upon our reflective component model.
Load Balancing in Bounded-Latency Content Distribution
Authors: Chengdu Huang, Gang Zhou, Tarek F. Abdelzaher, Sang Hyuk Son, John A. Stankovic
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

In this paper we present a balanced data replication scheme that provides real-time latency bounds on content retrieval in content distribution networks. Many network applications have ever-increasing requirements on latency sensitive data services. Data replication services have been widely used as an important performance enhancement mechanism to reduce data access latency and throughput. We investigate the problem of provisioning an underlying balanced data replication service to provide a global latency bound on data retrieval in content distribution networks. The solution involves constructing an overlay network based on the given latency bound, and a mechanism to assign content objects to the network nodes so that the workload of all the network nodes is balanced. Our evaluation results drawn from detailed simluations show the efficacy of our load-balancing scheme in meeting the latency bound requirements with high confidence under heavy load.
A network interface unit simulation using micro PASSIM
Authors: Tom P. Vayda
Venue: ACM SIGSIM Simulation Digest (1985)

This paper describes how micro PASSIM, a GPSS based simulation system, was transported from the Apple II to the HP 9836. The problems associated with moving a large program form one UCSD Pascal system to another are discussed. Micro PASSIM was transported to the HP system so that an Ethernet to HPIB interface board could be modeled. The model is described and the results obtained from the simulation are discussed. A discussion of the advantages and disadvantages of using micro PASSIM rather than a standard language, such as GPSS, is also included.
An Architectural Approach for Decentralized Trust Management
Authors: Girish Suryanarayana, Justin R. Erenkrantz, Richard N. Taylor
Venue: IEEE Internet Computing (2005)

To guard against malicious peers, peer-to-peer applications must incorporate suitable trust mechanisms. Current decentralized trust-management research focuses mainly on producing trust models and algorithms, whereas the actual composition of trust models into real applications has been largely unexplored. The practical architectural approach for composing egocentric trust (Pace) provides detailed design guidance on where and how developers can incorporate trust models into decentralized applications. In addition, Pace's guiding principles promote countermeasures against threats to decentralized systems. Several prototypes demonstrate the approach's use and feasibility.
An Ultra-Low Power, Optically-Interrogated Smart Tagging and Identification System
Authors: Gerardo Barroeta Perez, Mateusz Malinowski, Joseph A. Paradiso
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

We present a wireless identification system that employs an optical communications link between an array of uniquely identifiable smart tags and an interrogator flashlight. As the tags consume a quiescent current of under 2 microamperes and are woken up directly by the interrogator's modulated illumination, they are able to last nearly the shelf life of their battery with moderate use. Unlike RFID, which requires a large antenna to achieve significant range, our system requires only a small photodiode, which enables very compact tags to be rapidly queried at a range of over 8 meters with a handheld flashlight interrogator. Our tags are currently aimed at an asset location scenario, where they pulse an onboard LED when their stored ID matches a query broadcast by the interrogator. We also present two different techniques that allow the tags to talk back to the interrogator — one that uses an onboard IR LED to send data a meter away when the interrogator illumination is off and another that uses the onboard green indicator LED for proximate operation. We present our hardware and system design, analyze its performance, and discuss powering the tag from ambient illumination sources.
Multilingual disaster information system: information delivery using graphic text for mobile phones
Authors: Satoshi Hasegawa, Kumi Sato, Shohei Matsunuma, Masaru Miyao, Kohei Okamoto
Venue: AI Society (2005)

A multilingual disaster information system (MLDI) has been developed to overcome the language barrier during times of natural disaster. MLDI is a web-based system that includes templates in nine languages so that translated texts can be made available immediately. Mobile phone e-mail with graphic text is a useful tool for delivering multilingual disaster information. The visibility of graphic text on mobile phones was measured and found to be equivalent to the built-in font. However, visibility deteriorates as the character size becomes smaller, especially, on displays with poor resolution. This article also discusses the necessity of multilingual information and measures for a safe and barrier-free society.
Learning hierarchical multi-category text classification models
Authors: Juho Rousu, Craig Saunders, Sandor Szedmak, John Shawe-Taylor
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We present a kernel-based algorithm for hierarchical text classification where the documents are allowed to belong to more than one category at a time. The classification model is a variant of the Maximum Margin Markov Network framework, where the classification hierarchy is represented as a Markov tree equipped with an exponential family defined on the edges. We present an efficient optimization algorithm based on incremental conditional gradient ascent in single-example subspaces spanned by the marginal dual variables. Experiments show that the algorithm can feasibly optimize training sets of thousands of examples and classification hierarchies consisting of hundreds of nodes. The algorithm's predictive accuracy is competitive with other recently introduced hierarchical multi-category or multilabel classification learning algorithms.