ppxscal/embedding_network huggingface dataset:
Early evaluation of future consumer AV content analysis applications with PC networks
Authors: Jan Nesvadba, Fons Lange
Venue: Multimedia Tools and Applications (2007)

The paper deals with software productivity improvement for consumer multimedia devices by means of PC and component technology and shows how this is done for complex real-time content analysis applications used in advanced new storage products of the future. Content analysis is a relatively new and immature technology. It is used for browsing and searching particular content items among thousands of others on "big" embedded storage devices like hard disks. As the storage capacity of hard disk and flash continues to grow rapidly, content analysis is bound to become a key enabling technology in future storage products. A major problem with content analysis features (and many other features as well) is that underlying algorithms are unstable, sometimes unavailable, or at least, very much in their infancy, and as such, subject to frequent changes. The paper describes an approach to facilitate early evaluation and integration of such immature features. This is done by packing each feature, as-is, into components and by providing PC network technology to interconnect them. In our prototyping framework, each component is an independent executable program that runs on some PC in the network, streaming AV data via TCP/IP and being controlled through UPnP networking. Experiences with large-scale prototyping activities we have carried out for the assessment of future content analysis systems, show that a PC based prototyping approach enables the integration of many different media processing features in a short time and that it allows for accurate analysis of the resource (CPU/memory) requirements of such components.
Pattern Recognition in Mining High-Throughput Genomics/Proteomics Data: The New Challenges in Old Questions
Authors: Xuegong Zhang
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The current molecular biology and systems biology is featured by the rapid accumulation of high-throughput genomics and proteomics data like microarray and mass spectrometry (MS) data. Typical applications of these high-throughput biological data include the use of microarray or MS data for the molecular classification of complex human diseases like cancers, and for discovering the genes/protein markers (biomarkers) underlying the classification. Such tasks have been intensively studied as a new application field of pattern recognition in recent years. Almost all existing methods for classification and feature selection have been tried, and a large number of new or revised methods have been proposed.
Model Driven Design and Implementation of Statistical Surveys
Authors: Chul Hwee Kim, John Hosking, John Grundy
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We describe the evolution of a statistical survey design visual language from a standalone design-time modelling language into an environment supporting design, coordination, execution and publication of complex statistical surveys. This involved, firstly, elaboration of the notation to support additional requirements, notably in the area of task modelling. Secondly, tool support has been extended to allow association of model components with survey artefacts, such as data sets, metadata, and statistical package analysis procedures, with the ability to then execute elements of the survey design model to implement the survey analysis. This permits rapid exploration of statistical questions, together with the ability to publish both analysis results and the techniques and processes used, the latter in the form of executable web services and generated documentation. Thirdly, we have undertaken a usability evaluation with a target end user sample that demonstrates strong satisfaction with the tool.
One-way Delay Measurement and Characterization
Authors: Ana Hernandez, Eduardo Magana
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In network characterization and network tomography, delay is one of the meaningful parameters to consider. Inside end-to-end delay, one-way delay provides much more information than typical round-trip time. Measuring one-way delay is complex and several components can be distinguished. Measurement errors committed by conventional monitoring hardware are presented. A high-precision European measurement infrastructure has been used to run our experiments and to check general behavior for one-way delay. Maximum likelihood estimation is used to provide generic distribution fitting for one-way delay. The information of one-way delay is also applied to available bandwidth estimation and topology changes during extensive periods of time.
Refining buffer overflow detection via demand-driven path-sensitive analysis
Authors: Wei Le, Mary Lou Soffa
Venue: Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2007)

Although static analysis is an important technique for detecting buffer overflow before software deployment, current static tools rely on considerable human effort for annotating code to help analysis, or for diagnosing warnings, many of which are false positives. This paper presents an analysis technique that refines information about the paths that involve a potential buffer overflow to help in the diagnosis and debugging of vulnerabilities. Instead of only reporting a vulnerable buffer or statement in the program, which most tools do, our analysis categorizes paths of a possibly vulnerable statement into five types: Vulnerable, Overflow-User-Independent, Safe, Infeasible and Don't-Know. Thus, safe and infeasible paths can be excluded from being inspected, providing focus on problematic paths. For scalability, we designed and implemented our analysis as an interprocedural, demand-driven path-sensitive analysis. Our experiments demonstrate that various path types do go through a possibly vulnerable buffer statement. The results also indicate that our technique is efficient and practical.
Cobalt: separating content distribution from authorization in distributed file systems
Authors: Kaushik Veeraraghavan, Andrew Myrick, Jason Flinn
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

How should a distributed file system manage access to protected content? On one hand, distributed storage should make data access pervasive: authorized users should be able to access their data from any location. On the other hand, content protection is designed to restrict access -- this is often accomplished by limiting the set of computers from which content can be accessed. In this paper, we propose a new method for storing content in distributed storage called Cobalt. Rather than grant access to data based on the computer that reads the data, Cobalt grants access based on the physical proximity of authorized users. Protected content is stored encrypted in the distributed Blue File System; files can only be decrypted through the cooperation of a personal, mobile device such as cell phone. The Cobalt device is verified by content providers: it acts as a proxy that protects their interests by only decrypting data when policies specified during content acquisition are satisfied. Wireless communication with the device is used to determine the physical proximity of its user; when the Cobalt device moves out of range, protected content is made inaccessible. Our results show that Cobalt adds only modest overhead to content acquisition and playback, yet it enables new forms of interaction such as the ability to access protected content on ad hoc media players and create playlists that adapt to the tastes of nearby users.
Adaptive edge-based interpolation for scanning rate conversion
Authors: M. I. Elmasry
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

An adaptive technique for scanning rate conversion and interpolation is proposed. This technique performs better than the edge based line average algorithm, especially for an image with more horizontal edges. Moreover, it is easy to implement and a simple VLSI architecture is proposed in this paper. Computer simulation shows that a 37.0 dB image can be obtained via our proposed technique, while edge based line average algorithm only achieve 35.2 dB.
How up-to-date are Online Tourism Communities? An Empirical Evaluation of Commercial and Non-commercial Information Quality
Authors: Marco Prestipino, Felix-Robinson Aschoff, Gerhard Schwabe
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

While social and economic aspects of online communities have been investigated broadly, the information exchanged has seldom been the subject of study. The article follows recent work on using an information systems metaphor for online communities: users specify queries and receive information from the online community members. In order to justify this metaphor, information needs to be at least up to classic information products. In this paper we present a framework for the evaluation of timeliness in online communities. An empirical study is presented which compares aspects of timeliness, namely up-to-dateness, for a wiki community and a printed guidebook. Results show that the community is at least as up-to-date as the printed guidebook. While further research is needed, results indicate that online communities can be used as information systems with reasonable information quality values.
Dynamic Carrier-Assisted Routing in Mobile Networks
Authors: Jie Wu
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

We propose to use node mobility to enhance routing capability in a mobile network. A dual-control planes model is presented, which includes the traditional S(stationary)-plane for message routing among stationary nodes using connection-based message routing. In addition, we introduce a new control plane, M(mobile)-plane, for trajectory control of mobile nodes. A message routing consists of a sequence of control plane switches, alternating between store-and-forward in the S-plane and store-carry-forward in the M-plane. Intra-plane and interplane communication is performed through contacts. In the M-plane, unlike most existing works that focus on two extremes of spectrums (random movement and tightly controlled movement), our approach focuses on loosely-controlled movement of mobile nodes to assist message routing in a store-carry-forward paradigm. The challenge lies in adapting the degree of control to support a certain degree of flexibility, such as using dynamic node trajectory to maximize route sharing to minimize the number of carriers, while ensuring some desirable global properties, such as short average-moving-distance and a small number of relays to increase network capacity.
Learner's Activity During the Understanding of an Interactive Animated Mechanical System: eye Tracking Investigation
Authors: Emmanuel Schneider, Jean-Michel Boucheix
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

In two experiments we examined how leurners understand an animation about u mechanicul complex three pulley system. In the first experintent were tested the unitnation user-control and the orientation of the attention ofthe learners. The second experiment tested the potential effect of adding signaling cues like arrows on the comprehension of the mechanicul device. In the two experimental designs are tracking was registered before a comprehension test The first experiment showed a positive effect of a full controllable animation and also of a verbal explicit orientation of attention on the understanding of the pulley system The eye tracking data indicated that the leurners process strongly the areas of the animations where u great amount of motion is involved along the casual chain of events. The second experiment did not show any effect of adding implicit signaling cues.
Engineering students as expert witnesses in mock trials
Authors: K. M. Tarhini
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The purpose of this paper is to report our experience with senior civil engineering students serving as expert witnesses in simulated civil court actions involving a structural failure. The uniqueness of this exercise was two fold: (1) it forced students to completely understand the causes of the structural collapse so they might clearly explain those causes, and (2) it compelled collaboration with third year law students to present the failure evidence in mock trials. Three mock trials were performed as part of a Trial Practice course offered during fall 1999 term at the School of Law. Three teams, each consisting of two engineering students and two law students, were assigned to represent the plaintiff designer, and contractor in each trial. Each team of engineering and law students met several times to discuss the assigned case and prepare each other for the mock trial. Engineering students had to explain in lay terms all the technical concepts involved in the case and give their opinion of the probable cause of failure. Law students prepared the engineers to testify as experts in a courtroom setting under direct and cross-examinations. The students argued and presented their cases in the presence of a practising judge. The students gained valuable experience in teamwork, communications, performing under pressure in a courtroom, and understanding the importance of each discipline in the litigation process. The experience of testifying as experts in a courtroom showed the engineering students the importance of details, technical competency, objectively, reviewing the work of others, and the ethical dilemmas in professional practice. This experience encouraged engineers to collaborate with lawyers and prepared them for the future possibility of being involved in litigation and testifying in a courtroom.
Fingerprint Matching Algorithm Based on Tree Comparison using Ratios of Relational Distances
Authors: Abinandhan Chandrasekaran, Bhavani Thuraisingham
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

We present a fingerprint matching algorithm that initially identifies the candidate common unique (minutiae)points in both the base and the input images using ratios of relative distances as the comparing function. A tree like structure is then drawn connecting the common minutiae points from bottom up in both the base and the input images. Matching score is obtained by comparing the similarity of the two tree structures based on a threshold value. We define a new term called the "M (i) - tuple' for each minutiae point which uniquely encodes details about the local surrounding region, where i = 1 to N, and N is the number of minutiae. The proposed algorithm requires no explicit alignment of the two to-be compared fingerprint images and also tolerates distortions caused by spurious minutiae points. The algorithm is also capable of comparing and producing matching scores between two images obtained from two different kinds of sensors, hence is sensor interoperable and also reduces the FNMR in cases where there is very little overlap region between the base and the input image. We conducted evaluations on the FVC-2000 [1] datasets and have summarized the results in the concluding section.
Automatic digital pre-compensation in IQ modulators
Authors: J. Tuthill
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In digital IQ modulators generating continuous phase frequency shift keying (CPFSK) signals, departures from flat-magnitude, linear phase in the pass bands of signal reconstruction filters in the I and Q channels cause ripple in the output signal envelope. Amplitude modulation (AM) in the signal envelope function produces undesirable sidelobes in the FSK signal spectrum when the signal passes through nonlinear elements in the transmission path. A structure is developed for digitally pre-compensating for the magnitude and phase characteristics of signal reconstruction filters. Optimum digital pre-compensation filters are found using least squares (LS) techniques and we propose a method by which the optimum pre-compensation filters can be estimated using test input signals. This method can be used as part of an automatic compensation process.
Sinc-Galerkin method based on the DE transformation for the boundary value problem of fourth-order ODE
Authors: Ahniyaz Nurmuhammad, Mayinur Muhammad, Masatake Mori
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper a Sinc-Galerkin method incorporated with the double exponential transformation (abbreviated as the DE transformation) for the two-point boundary value problem of fourth-order ordinary differential equation is considered. In this method the error bound O(exp(-c^'N/logN))(c^'>0) is attained as in the Sinc-collocation method based on the DE transformation where N is a parameter representing the number of terms in the Sinc approximation. High efficiency of the Sinc-Galerkin method with the DE transformation is confirmed by some numerical examples and the numerical results were compared with ones obtained by Sinc-collocation method based on the DE transformation.
Transient Stability Assessment of a Power System with a Static Synchronous Series Compensator
Authors: P. Kumkratug, P. Laohachai
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Static Synchronous Series Compensator (SSSC) is widely used in power systems to control power of power system by injecting appropriate reactive power into the system. It also has the capability of improving stability and damping by dynamically controlling its reactive power output. This paper presents the energy function of a power system with a SSSC. The proposed energy function is used for transient stability assessment of a power system. This paper develops the control strategy of a SSSC for transient stability and dynamic improvement.
S-Club: an overlay-based efficient service discovery mechanism in CROWN Grid
Authors: Chunming Hu, Yanmin Zhu, Jinpeng Huai, Yunhao Liu, Lionel M. Ni
Venue: Knowledge and Information Systems (2007)

Information service plays a key role in grid system, handles resource discovery and management process. Employing existing information service architectures suffers from poor scalability, long search response time, and large traffic overhead. In this paper, we propose a service club mechanism, called S-Club, for efficient service discovery. In S-Club, an overlay based on existing Grid Information Service (GIS) mesh network of CROWN is built, so that GISs are organized as service clubs. Each club serves for a certain type of service while each GIS may join one or more clubs. S-Club is adopted in our CROWN Grid and the performance of S-Club is evaluated by comprehensive simulations. The results show that S-Club scheme significantly improves search performance and outperforms existing approaches.
Integrating Fault Recovery and Quality of Security in Real-Time Systems
Authors: Kiranmai Bellam, Ziliang Zong, Mohammed I. Alghamdi, Mais Nijim, Xiao Qin
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In the past five years, mandatory security requirements and fault tolerance have become critical criteria for most real-time systems. Although many conventional fault-tolerant or security approaches were investigated and applied to real-time systems, most existing schemes only addressed either security demands ignoring the fault-tolerant requirements or vice versa. To bridge this technology gap in real-time systems, in this paper we propose a way of integrating fault recovery and confidentiality services. The novel integration of security and fault recovery makes it possible to implement next-generation real-time systems with high reliability and quality of security. Experimental results from real-world applications show that our approach can significantly improve security over the conventional approaches by up to 661.56% while providing an efficient means of fault tolerance.
Operation-based update propagation in a mobile file system
Authors: Yui-Wah Lee, Kwong-Sak Leung, Mahadev Satyanarayanan
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

In this paper we describe a technique called operation-based update propagation for efficiently transmitting updates to large files that have been modified on a weakly connected client of a distributed file system. In this technique, modifications are captured above the file-system layer at the client, shipped to a surrogate client that is strongly connected to a server, re-executed at the surrogate, and the resulting files transmitted from the surrogate to the server. If re-execution fails to produce a file identical to the original, the system falls back to shipping the file from the client over the slow network. We have implemented a prototype of this mechanism in the Coda File System on Linux, and demonstrated performance improvements ranging from 40 percents to nearly three orders of magnitude in reduced network traffic and elapsed time. We also found a novel use of forward error correction in this context.
Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories
Authors: Gennaro Cordasco Vittorio Scarano Arnold L. Rosenberg
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Techniques are developed for mapping structured data to an ensemble of parallel memory modules in a way that limits the number of conflicts, i.e., simultaneous accesses by distinct processors to the same memory module. The techniques determine, for any given conflict tolerancec, the smallest ensemble that allows one to store anyn{\hbox{-}}\rm node data structure "of type X” in such a way that no more than c nodes of a structure are stored on the same module. This goal is achieved by determining the smallest c{\hbox{-}}{\it perfect universal graphs} for data structures "of type X.” Such a graph is the smallest graph that contains a homomorphic image of each n{\hbox{-}}\rm node structure "of type X,” with each node of the image holding \leq c nodes of the structure. In the current paper, "type X” refers to rooted binary trees and three array-like structures: chaotic arrays, ragged arrays, and rectangular arrays. For each of these families of data structures, the number of memory modules needed to achieve conflict tolerance c is determined to within constant factors.
MiniRTL hard real time linux for embedded systems
Authors: Nicholas Mc Guire
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

Embedded system development is moving away from single-task/user applications running on specialized target platform towards a reduced general purpose OS running on PC-like hardware. This move is well represented by Linux based embedded projects and specialized minimum GNU/Linux distributions. As a sample system and a basis for development of hard-real time embedded systems MiniRTL was developed at the University of Vienna and at FSMLabs New Mexico. A system that is designed around three major tenets: - bootable off a 1.44MB media (currently simply a floppy) - hard-real time capabilities, based on FSMLabs' current RTLinux development - maximum compatibility to a "standard" desktop development system running an up-to-date kernel. In this paper strategies to reach these goals will be described and the successful implementation in a running system, MiniRTL, demonstrated. These changes are mostly applicable to all embedded Linux efforts and are not specific to RTLinux.