ppxscal/embedding_network huggingface dataset:
Design and Implementation of ATA-Based Virtual Storage System for Mobile Device
Authors: Yu-Shu They, Chee-Min Yeoh, Hoon-Jae Lee, Hyotaek Lim
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Mobile technology is an essential element in constructing a ubiquitous computing environment. However, the storage limitation on mobile devices has become a significant problem due to the rapid development of data-intensive mobile applications nowadays. In this paper, we present the design and implementation of a new block-level storage network protocol, iATA (Internet Advanced Technology Attachment) as a counter to the above problem. This protocol enables the ATA device commands to be transported over the TCP/IP network and hence allows an ATA hard disk to be mounted remotely from a wireless connected mobile device. Due to the popularity of wireless infrastructures and ATA technologies, iATA is considered as a relatively cost effective and lightweight solution if compared to card storages or other network storage protocols. The result of prototype implementation shows that our proposed solution is feasible to be applied on a resource limited device.
Merged Dictionary Code Compression for FPGA Implementation of Custom Microcoded PEs
Authors: Bita Gorjiara, Mehrdad Reshadi, Daniel Gajski
Venue: ACM Transactions on Reconfigurable Technology and Systems (TRETS) (2008)

Horizontal Microcoded Architecture (HMA) is a paradigm for designing programmable high-performance processing elements (PEs). However, it suffers from large code size, which can be addressed by compression. In this article, we study the code size of one of the new HMA-based technologies called No-Instruction-Set Computer (NISC). We show that NISC code size can be several times larger than a typical RISC processor, and we propose several low-overhead dictionary-based code compression techniques to reduce its code size. Our compression algorithm leverages the knowledge of &ldquo;don't care&rdquo; values in the control words and can reduce the code size by 3.3 times, on average. Despite such good results, as shown in this article, these compression techniques lead to poor FPGA implementations because they require many on-chip RAMs. To address this issue, we introduce an FPGA-aware dictionary-based technique that uses the dual-port feature of on-chip RAMs to reduce the number of utilized block RAMs by half. Additionally, we propose cascading two-levels of dictionaries for code size and block RAM reduction of large programs. For an MP3 application, a merged, cascaded, three-dictionary implementation reduces the number of utilized block RAMs by 4.3 times (76%) compared to a NISC without compression. This corresponds to 20% additional savings over the best single level dictionary-based compression.
Pro WF: Windows Workflow in .NET 3.5, 1 edition
Authors: Bruce Bukovics
Venue: Pro (2008)

Windows Workflow Foundation is a groundbreaking addition to the core of the .NET Framework that allows you to orchestrate human and system interactions as a series of workflows that can be easily mapped, analyzed, adjusted, and implemented. As business problems become more complex, the need for a workflowbased solution has never been more evident. WF provides a simple and consistent way to model and implement complex problems. As a developer, you focus on developing the business logic for individual workflow tasks. The runtime handles the execution of those tasks after they have been composed into a workflow. Pro WF: Windows Workflow in .NET 3.5 provides you with the skills you need to incorporate WF in your applications. This book gets you up to speed with Windows Workflow Foundation quickly and comprehensively. The practical aspects of using WF are covered in a lively tutorial style with each workflow concept illustrated in C#. Youll find detailed coverage of how to customize your workflows and access them in a variety of ways and situations so you can maximize the advantages of this technology. Pro WF: Windows Workflow in .NET 3.5 is written by an experienced Windows and .NET developer. Rather than simply duplicating the available references on the subject, author Bruce Bukovics leads you through a series of practical WF topics that enable you to gain immediate experience and learn how to use the technology as you progress through the book. What youll learn WF basics Customizing your workflows Accessing your workflows in a variety of ways in a variety of situations Using WF with web services and ASP.NET Integrating WCF and WF Who is this book for? Developers encountering WF and .NET 3.5 for the first time in their professional lives About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career. Related Titles Workflow in the 2007 Microsoft Office System Foundations of WF: an Introduction to Windows Workflow Foundation Pro WCF: Practical Microsoft SOA Implementation
A study of suspended roofs for near-source seismic motions
Authors: Ioannis G. Raftoyiannis, Constantine C. Spyrakos
Venue: Computers and Structures (2008)

The non-linear behavior of multi-suspended roof systems for seismic loads is studied. The study is based on a formulation that can be easily employed for a preliminary design of multi-suspended roofs subjected to seismic loads. Specifically, applying Lagrange's equations, the corresponding set of equations of motion for discrete models of multiple suspension roofs is obtained and numerical integration of the equations of motion is performed via the Runge-Kutta scheme. For representative realistic combinations of geometric, stiffness and damping parameters, a non-linear analysis is employed to study the behavior of suspended roofs for near-source and far-field seismic motions. The analysis demonstrates that: (i) code-specified design loads could dramatically underestimate the response of suspended roofs subjected to near-source ground motions and (ii) flexible roofing systems are greatly affected by near-source ground motions, a behavior that is not observed for stiff systems.
Some thoughts on failure analysis for noisy data
Authors: Donna Harman
Venue: Proceedings of the second workshop on Analytics for noisy unstructured text data (2008)

A critical piece of evaluation is doing a failure analysis of the experimental results. This is necessary to improve results, but equally important, it is necessary to understand where the problems REALLY are, as opposed to just following "conventional" wisdom. The talk will present some current failure analysis techniques and examine how these techniques could be extended to retrieval from noisy data.
Challenges and strategies in the use of Open Source Software by Independent Software Vendors
Authors: Kris Ven, Herwig Mannaert
Venue: Information and Software Technology (2008)

Open Source Software (OSS) has already been adopted by a large number of organizations. An important - but sometimes neglected - group of OSS users are Independent Software Vendors (ISVs). ISVs often develop their applications on top of OSS platform software. Frequently, this requires making several extensions and modifications to these OSS components. We identify a number of challenges that ISVs face in handling these extensions and modifications. Next, we describe several strategies ISVs can follow in maintaining these modifications. Finally, we suggest an opportunity for a closer collaboration between OSS projects and ISVs which could be mutually beneficial.
A simple and efficient kinetic spanner
Authors: Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

We present a new and simple (1+ε)-spanner of size O(nε2) for a set of n points in the plane, which can be maintained efficiently as the points move. Assuming the trajectories of the points can be described by polynomials whose degrees are at most s, the number of topological changes to the spanner is O((n/ε2).λs+2(n)), and at each event the spanner can be updated in O(1) time.
Shape Deformation Using a Skeleton to Drive Simplex Transformations
Authors: Han-Bing Yan, Shimin Hu, Ralph R. Martin, Yong-Liang Yang
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

This paper presents a novel skeleton-based method for deforming meshes (using an approximate skeleton, rather than a precise medial axis). The significant difference from previous skeleton-based methods is that the latter use the skeleton to control movement of vertices whereas we use it to control the simplices defining the model. By doing so, errors that occur near joints in other methods can be spread over the whole mesh, using an optimization process, resulting in smooth transitions near joints of the skeleton. By controlling simplices, our method has the advantage that no vertex weights need to be defined on the bones, which is a tedious requirement in previous skeleton-based methods. Our method can also easily be extended to control deformation by moving a few chosen line segments or vertices embedded in the object, rather than a skeleton.
High-Precision Relative Clock Synchronization Using Time Stamp Counters
Authors: Guo-Song Tian, Yu-Chu Tian, Colin Fidge
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

In this paper we show how to use a computer processor’s Time Stamp Counter register to provide a precise and stable time reference, via a high-precision relative clock synchronization protocol. Existing clock synchronization techniques, such as the Network Time Protocol, were designed for wide-area networks with large propagation delays, but the millisecond-scale precision they offer is too coarse for local-area applications such as instrument monitoring systems, high-quality digital audio systems and sensor networks. Our new clock synchronization technique does not require specialized hardware but instead uses the Time Stamp Counter already available in the widely-used Intel Pentium processor. Experimental results show that we can achieve a synchronization precision in the order of 10 microseconds in a small-scale local area network using TSC registers, which is much higher than can be achieved by using a computer processor’s Time-Of-Day clock.
New efficient and practical verifiable multi-secret sharing schemes
Authors: Massoud Hadian Dehkordi, Samaneh Mashhadi
Venue: Information Sciences: an International Journal (2008)

In 2006, Zhao et al. proposed a practical verifiable multi-secret sharing based on Yang et al.'s and Feldman's schemes. In this paper we propose two efficient, computationally secure (t,n), and verifiable multi-secret sharing schemes based on homogeneous linear recursion. The first scheme has the advantage of better performance, a new simple construction and various techniques for the reconstruction phase. The second scheme requires fewer public values with respect to Zhao et al.'s and Shao and Cao schemes. These schemes are easy to implement and provide great capabilities for many applications.
Translation of an existing VMM-based SystemVerilog testbench to OVM
Authors: Kelly D. Larson
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Many features built into the SystemVerilog language make it an extremely effective high-level verification language. Using class libraries with SystemVerilog can take this a step further by enhancing productivity, and enabling better, more efficient reuse between engineers and between projects. The Verification Methodology Manual (VMM) class library was one of the first SystemVerilog class libraries available, and has been widely adopted. The Open Verification Methodology (OVM) class library has just recently become available, and while it is similar to VMM in many respects, there are also some important differences. This paper will describe the process of converting an existing testbench based on VMM class libraries, to one based on OVM class libraries. The VMM testbench selected for the conversion to OVM was developed for the verification of a custom memory controller for a general purpose DSP SOC. The EBIU (External Bus Interface Unit) is complex enough to require a non-trivial testbench, and the large number of system busses makes it an interesting candidate for a randomized SystemVerilog testbench approach. This paper will begin by describing the conversion process of the basic testbench components, including transaction classes and bus functional models. The next step is converting the testbench environment, and adding the extra layers of abstraction which are part of the OVM methodology. Finally, the conversion of the actual tests is described, including the configuration phase, and the transaction generation. The paper will conclude by summarizing the similarities and differences between the two approaches, and highlight which aspects of the conversion were straight forward, and which aspects required more attention.
Homologa efectiva y sucesiones espectrales (abstract only)
Authors: Ana Romero Ibáñez Ibáñez
Venue: ACM Communications in Computer Algebra (2008)

Effective homology and spectral sequences are two different techniques of Algebraic Topology which can be used for the computation of homology and homotopy groups. In this work we try to relate both methods, showing that the effective homology method can also be used to produce algorithms computing some spectral sequences. In the thesis we focus our attention on two particular situations: spectral sequences associated with filtered complexes and the Bousfield-Kan spectral sequence. The first part of the memoir is devoted to spectral sequences of filtered complexes, which under some good conditions converge to the homology groups of the initial complex. Making use of the effective homology method, we have developed several algorithms computing the different components of these spectral sequences: groups and differential maps in every stage, convergence level and filtration of the homology groups induced by the initial filtration. These algorithms have been implemented as a new module for the Kenzo system, a program of Symbolic Computation in Algebraic Topology, and can be used to determine two classical examples of spectral sequences, those of Serre and Eilenberg-Moore. Other spectral sequences are not defined by means of filtered complexes. This is the case of the Bousfield-Kan spectral sequence, related with the computation of homotopy groups, which is studied in the second part of the thesis. Our algorithms for the computation of spectral sequences of filtered complexes cannot be applied, but the effective homology method can be useful again to develop a constructive version of the Bousfield-Kan spectral sequence. As a first necessary step, our main result is an algorithm computing the effective homology of the free simplicial Abelian group RX generated by a 1-reduced simplicial set X. This algorithm allows the construction of the levels 1 and 2 of the spectral sequence; for the computation of the higher "pages", we present a sketch of a new algorithm which is not finished yet. Furthermore, we include a proof of the convergence of the spectral sequence.
Proceedings of the 2008 workshop on Testing, analysis, and verification of web services and applications
Authors: Tevfik Bultan, Tao Xie
Venue: International Symposium on Software Testing and Analysis (2008)

The last decade has seen the explosive growth of interactive Web software applications in a diverse set of domains including retail, electronic commerce, wikis, blogs, social network services, etc. This explosive growth is likely to accelerate further by adoption of the service oriented computing paradigm that enables interactions among Web accessible software components. Challenges in developing Web accessible software have inspired a new wave of languages, standards, and tools that have not yet become part of the mainstream software engineering research and education. On the other hand, an increasingly large number of software developers work exclusively on Web software development. TAV-WEB 2008 is the third in a series of workshops that focus on testing, analysis and verification of web software. The scope of TAV-WEB 2008 has been extended (from the web service scope of previous workshops TAV-WEB 2004 and TAV-WEB 2006) to include all Web software. The goal of these workshops has been to bring together researchers from academic, research, and industrial communities interested in the emerging area of dependable Web software development, to present and discuss their recent research results. The TAV-WEB 2008 program consists of seven technical papers and an invited tool demonstration reporting recent research results on testing, analysis and verification of web software.
MAPS: an integrated framework for MPSoC application parallelization
Authors: J. Ceng, J. Castrillon, W. Sheng, H. Scharwächter, R. Leupers, G. Ascheid, H. Meyr, T. Isshiki, H. Kunieda
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In the past few years, MPSoC has become the most popular solution for embedded computing. However, the challenge of programming MPSoCs also comes as the biggest side-effect of the solution. Especially, when designers have to face the legacy C code accumulated through the years, the tool support is mostly unsatisfactory. In this paper, we propose an integrated framework, MAPS, which aims at parallelizing C applications for MPSoC platforms. It extracts coarsegrained parallelism on a novel granularity level. A set of tools have been developed for the framework. We will introduce the major components and their functionalities. Two case studies will be given, which demonstrate the use of MAPS on two different kinds of applications. In both cases the proposed framework helps the programmer to extract parallelism efficiently.
Validation of integrated potential fishing zone (IPFZ) forecast using satellite based chlorophyll and sea surface temperature along the east coast of India
Authors: S. B. Choudhury, B. Jena, M. V. Rao, K. H. Rao, V. S. Somvanshi, D. K. Gulati, S. K. Sahu
Venue: International Journal of Remote Sensing (2007)

An attempt was made with regards to the application of satellite-derived sea surface temperature (SST) and chlorophyll together in assisting the fishing industry located along the east coast of India. Information on features such as fronts, eddies, gyres, currents and upwelling derived from satellites is useful in fisheries, since fishes usually congregate in these areas for feeding. SST and chlorophyll concentration are retrieved from NOAA-AVHRR (NOAA-advanced very high-resolution radiometer) and IRS-P4 OCM (OCM-ocean colour monitor) sensor respectively. Features are extracted from the SST and chlorophyll retrievals and these features are transferred onto a scaled base map called an 'integrated potential fishing zone (IPFZ)' map. Fishery Survey of India (FSI) fishing vessels of Visakhapatnam base were used to validate the suggested IPFZs. This exercise was conducted during November 2002, March, April and December 2003 and January 2004. The feedback in terms of categorized fish catch per unit effort (CPUE, total catch divided by actual fishing hours) along with location information obtained from FSI, Visakhapatnam has been incorporated in the IPFZ image. The catch per unit effort (CPUE) is computed taking total catch divided by actual fishing hours. The validation shows that the CPUE is high in the IPFZ areas compared with surroundings. In most of the cases, except January 2004, more than an order increase in fish catch is observed in the IPFZ notified areas along east coast of India. A marginal increase is observed in the suggested IPFZ areas during January 2004.
Audio Digital Watermarking Algorithm Based on SVD in MCLT Domain
Authors: Radek Zezula, Jirí Miurec
Venue: Proceedings of the Third International Conference on Systems (2008)

We present a digital audio signal watermarking method based on Singular Value Decomposition, which works in the transform domain, especially in the Modulated Complex Lapped Transform (MCLT) domain. This method does not require the original audio signal for watermark extraction. The experimental test shows much robustness as regards manipulation during common audio signal processing.
Using Aspect-Oriented Programming for Trustworthy Software Development
Authors: Vladimir O. Safonov
Venue:  (2008)

* Provides the necessary tools to complete trustworthy computing tasks more efficiently with AOP. * Includes practical information on a working AOP tool for .NET (Aspect.NET) and a number of working examples of how to use AOP for the purposes of TWC. * Solutions throughout the book include traditional software engineering metrics and comparisons to agile/xp programming and SCRUM. * Targets practical day to day TWC tasks and other needs of the software engineer
An analytical framework to model an H.264 video encoder for transmission on the Internet
Authors: Francesco Licandro, Giovanni Schembra, Valeria Tomaselli
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

One of the most widely used encoding standards for video transmission at a low bit rate is H.264. Many techniques have been introduced in the literature to control the output stream of an H.264 encoder, in order to respect the available bandwidth or the declared bandwidth. The majority of them allow users to define a given target for the output bit rate of an H.264 video source; this is achieved by skipping captured frames before encoding. The higher the number of frames the encoder skips, the higher the motion discontinuity perceived by the human eye. The main contribution of the framework is to support designers in the choice of H.264 traffic descriptors during call setup, such as the per-frame target parameter, representing the maximum number of packets the source can transmit in the network in a frame interval.
Particle measurement in scanning electron microscopy images
Authors: D. Cuesta-Frau, M. A. Hernández-Fenollosa, J. Vicedo-Payá, F. Jiménez-López
Venue: Machine Graphics Vision International Journal (2006)

This paper describes the segmentation of nanoparticles of ZnO obtained by mechanical milling. Segmentation of objects in images is a common application of computer vision methods. In contrast to manual segmentation, these techniques are fast, objective, and accurate. We describe in this paper a method based on such techniques aimed at segmenting the particles in a microscopic image of ZnO in order to obtain an approximation of the grain size, and a measure of the homogeneity, in a non-supervised way. The images are obtained using scanning electron microscopy and then preprocessed to enhance the contrast and to reduce the noise. Next, an edge detection algorithm is applied to obtain the boundaries of the particles. Finally, the particles that satisfy a specific criterion are extracted and measured, and their measure is taken as an approximation of the particle size.