ppxscal/embedding_network huggingface dataset:
Distance Education: Some Differences in Course Type
Authors: Chuck Beck, William Benjamin Jr. Martz
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Building on Prior research which distinguishes the distance environment from the traditional environment, this study adds the dimension of course type to the research. The same questionnaire surveyed students across multiple types of courses (communications versus programming) and multiple formats (on-campus versus online). The findings reveal some differences identifiable to delivery type and to course type. These results suggest that researchers and practitioners should consider one more issue - course type - when dealing with the distance education environment.
Error Report Driven Post-Mortem Analysis
Authors: Yi Zhang, S. Purushothaman Iyer
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

Regulatory agencies, such as US FDA, and other third party reviewers of software have the task of comprehending a piece of software in the event of its failure. Program slicing is the preferred technique to analyze software failures. However, program slicing might yield extremely large slices and also demand that an user have intimate knowledge of the software (by specifying a slicing criterion). In this paper we propose solutions to ameliorate both of these problems. The main hypothesis of the paper is that error reports can be used to generate slicing criteria, thus allowing a third-party reviewer to use slicing without any knowledge of the system being analyzed. The first contribution of the paper is a study of how error reports can be formalized and how execution sequences (called error traces) that satisfy an error report can be identified, which can then be sliced. A primary feature of this work is that incomplete error reports could be dealt with. The second contribution of the paper is a scheme for using abstract interpretation in the generation of error traces and (potential) slicing criteria from error reports. These "abstract" error traces can be sliced, much like in dynamic/ conditional slicing, with respect to the criteria generated, allowing for inputs to be used to reduce the size of slices. Furthermore, being abstract in nature, they are shorter than exact execution sequences and also allow for easier comprehension. We finally present a case study involving a medical device that illustrates how our approach can aid with program comprehension.
A Primal Barvinok Algorithm Based on Irrational Decompositions
Authors: Matthias Ko&uml;ppe
Venue: SIAM Journal on Discrete Mathematics (2007)

We introduce variants of Barvinok&rsquo;s algorithm for counting lattice points in polyhedra. The new algorithms are based on irrational signed decomposition in the primal space and the construction of rational generating functions for cones with low index. We give computational results that show that the new algorithms are faster than the existing algorithms by a large factor.
Scalable Video Coding With Adaptive Video Interpolation
Authors: S. D. Bayrakeri
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We propose to use video-codec framework for the compression of volumetric medical images by treating interslice variations as "motion" of the tissues. As compression is necessary for telemedicine and archive, such an approach needs only slight modifications of existing codecs and is able to re-use most of the existing software and hardware. This is our main motivation and we seek modifications of the MPEG codec. An obvious modification is to replace block matching (BM) by more sophisticated methods. Specifically, we use the affine transformation (AT) on triangular patches. We implemented and compared our scheme with a simplified MPEG-1 encoder under identical parameters on a set of MRI images of a human hand. The blockiness is reduced dramatically and structures are better preserved. The images also appear less granular and show improvements of several dB in SNR. We expect further improvements when more features of MPEG codec are incorporated in our ongoing work.
An Intelligent Query System Based on Chinese Short Message Service for Restaurant Recommendation
Authors: Wubin. GUO, Xiangpei. HU, Kuanjiu. ZHOU, Lijun. SUN
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

With the development of modern communication technology, the mobile communication market has grown impressively in China. China Mobile and China Unicom have set up the largest mobile communication networks in the world. Concurrently, the number of Chinese short message service (SMS) user has been increased rapidly in recent 10 years. This huge customer infrastructure means immensurable market potential. The SMS-based restaurant recommendation is one of such services with potential market in China. With the promotion of their living level, more and more Chinese people spend their spare time on exciting trips to experience different custom and culture, especially the splendid catering culture in China. Therefore, they are most interested in where they can enjoy their favorite food while traveling in an unfamiliar city, which brings new commercial opportunities.
The Impact of Software Growth on the Electronics Industry
Authors: Michiel van Genuchten
Venue: Computer (2007)

What companies do today will determine their role in a world increasingly dominated by software.
An Analytical Approach to Scheduling Code for Superscalar and VLIW Architectures
Authors: Shyh-Kwei Chen, W. Kent Fuchs, Wen-Mei W. Hwu
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

Superscalar and Very Long Instruction Word (VLIW) architectures exploit fine-grain parallelism to achieve better performance. Static scheduling techniques, such as trace scheduling [1] and superblock scheduling [2], can effectively produce compact code for these architectures. In this paper, we present an analytical approach for bookkeeping in code scheduling that alleviates the coding complexity and instruction duplication limitations of the previous approaches. We describe techniques that allow instructions to be moved around loop and if-then-else constructs using global information. We also show that according to the classification of the register sets, certain instructions can be moved around subroutine calls, since their register live ranges can be predetermined across the procedural boundaries at compile time. Performance is compared with respect to the speed-up, the code size and the scheduling time. Experimental results indicate that the code growth and the speed-up are both improved with a small increase in scheduling time.
Integrating personal digital assistants (PDAs) into a computer science curriculum
Authors: K. L. Alford
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

During the Fall 2000 semester, 44 junior and senior computer science majors at the United States Military Academy, West Point, New York were issued personal digital assistants (PDAs) and were challenged to find useful ways to incorporate them into their curriculum and student life. Seniors were issued PDAs with 8 megabytes of RAM; juniors were issued PDAs with 2 megabytes of RAM. The West Point cadets rose to the occasion and quickly embraced this new technology. This effort has been successful and discussions are currently underway to determine if all Academy cadets, regardless of their program of study, should purchase PDAs.
Formation of pseudorandom sequences with improved autocorrelation properties
Authors: Yu. V. Stasev, A. A. Kuznetsov, A. M. Nosik
Venue: Cybernetics and Systems Analysis (2007)

An original technique is proposed for formation of pseudorandom sequences on the basis of coding methods. The synthesis of large ensembles of signals with improved autocorrelation properties is theoretically substantiated. Methods of correlation analysis are used to study auto-and crosscorrelation properties of sequences being formed.
A biorthogonal transform with overlapping and non-overlapping basis functions for image coding
Authors: T. Tanaka
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper presents a new framework for a biorthogonal lapped transform that consists of long and short basis functions called the VLLBT. It is shown that when the biorthogonal long basis functions of the VLLBT are given, the optimal short basis functions in the energy compaction sense are derived by solving an eigenvalue problem without iterative searching techniques. We also provide design and image coding examples of the VLLBT. The resulting VLLBT attains a high coding gain compared to other lapped transforms. Moreover, experimental results show that the proposed VLLBT is superior to other conventional transforms in terms of PSNR at a high compression ratio. Furthermore, it significantly reduces the annoying blocking artifacts.
Policy-Centric Integration and Dynamic Composition of Autonomic Computing Techniques
Authors: Richard John Anthony
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

This paper presents innovative work in the development of policy-based autonomic computing. The core of the work is a powerful and flexible policy-expression language AGILE, which facilitates run-time adaptable policy configuration of autonomic systems. AGILE also serves as an integrating platform for other self-management technologies including signal processing, automated trend analysis and utility functions. Each of these technologies has specific advantages and applicability to different types of dynamic adaptation. The AGILE platform enables seamless interoperability of the different technologies to each perform various aspects of self-management within a single application. The various technologies are implemented as object components. Self-management behaviour is specified using the policy language semantics to bind the various components together as required. Since the policy semantics support run-time re-configuration, the self-management architecture is dynamically composable. Additional benefits include the standardisation of the application programmer interface, terminology and semantics, and only a single point of embedding is required.
Optimized tile-based texture synthesis
Authors: Weiming Dong, Ning Zhou, Jean-Claude Paul
Venue: Proceedings of Graphics Interface 2007 (2007)

One significant problem in tile-based texture synthesis is the presence of conspicuous seams in the tiles. The reason is that the sample patches employed as primary patterns of the tile set may not be well stitched if carelessly picked. In this paper, we introduce an optimized approach that can stably generate an &omega;-tile set of high pattern diversity and high quality. Firstly, an extendable rule is introduced to increase the number of sample patches to vary the patterns in an &omega;-tile set. Secondly, in contrast to the other concurrent techniques that randomly choose sample patches for tile construction, our technique uses Genetic Algorithm to select the feasible patches from the input example. This operation insures the quality of the whole tile set. Experimental results verify the high quality and efficiency of the proposed algorithm.
A Unified Approach to Encoding and Classification Using Bimodal Projection-Based Features
Authors: Dipti Deodhare, M. Vidyasagar, M. Narasimha Murty
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

In general the objective of accurately encoding the input data and the objective of extracting good features to facilitate classification are not consistent with each other. As a result, good encoding methods may not be effective mechanisms for classification. In this paper, an earlier proposed unsupervised feature extraction mechanism for pattern classification has been extended to obtain an invertible map. The method of bimodal projection-based features was inspired by the general class of methods called projection pursuit. The principle of projection pursuit concentrates on projections that discriminate between clusters and not faithful representations. The basic feature map obtained by the method of bimodal projections has been extended to overcome this. The extended feature map is an embedding of the input space in the feature space. As a result, the inverse map exists and hence the representation of the input space in the feature space is exact. This map can be naturally expressed as a feedforward neural network.
Personality Matters: Incorporating Detailed User Attributes and Preferences into the Matchmaking Process
Authors: Jens Riegelsberger, Scott Counts, Shelly D. Farnham, Bruce C. Philips
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Finding ways of reducing undesired behavior in online interactions is at the forefront of the social computing research agenda. One promising way to reduce perceived "bad behavior" is by matching members of online social environments with corresponding behavioral preferences. We present an empirical study (N = 267) of an experimental system for matching users. As a test bed we chose the online game MechAssault, which largely supports one-off encounters within a socially homogenous population. Even within this population we found great variability in the way users selected their gaming partners. One type of player chose partners mainly on their skill, another mainly on a friendly gaming personality, and a third preferred aggressive players. Detailed analyses revealed the underlying attributes of user profiles that generated these user types. The findings suggest that a matchmaking system can better promote desired online interactions than the enforcement of uniform behavioral standards.
The Evaluation of Parallel FEM Techniques Based on Graph Partitioning
Authors: Guobin Zhou, Hong Jia, Yanlin Lu
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper studies and compares PNR and rMSATS methods for load balancing in parallel finite element analysis. Both the strengths and weaknesses of two algorithms are discussed. Some possible improvements to the two algorithms are also suggested and studied. A benchmark for evaluating algorithms is described. Direct numerical comparisons among the considered partitioning algorithms are then conducted using this benchmark. In addition, we think different algorithms as vertices of a undirected weighted graph. Choosing an algorithm from different partition methods is a recursive graph partitioning problem when dealing with a certain FEM computations. Choosing algorithm use heuristic algorithm in this paper. The initial value is critical at the heuristic algorithm. Wrong initial value leads to long execution time.
Agent-Based Information Logistics in Planning Processes
Authors: Freimut Bodendorf, Stefan Winkler, Roland Zimmermann, Bernd Vogele
Venue: Proceedings of the Second International Conference on Systems (2007)

Monitoring and coordination of planning processes requires a very flexible support by information systems. Due to the high amount of activities conducted in parallel as well as numerous interdependencies between inputs and outputs of every process step, present coordination concepts result in information deficits during process execution. In cooperation with an industry partner an agent-based information logistics system has been developed to reduce these deficits. The concept builds upon autonomic system approaches and event management paradigms. First results indicate that it is capable to streamline coordination processes.
Analysis of forward-only and forward-backward sample covariances
Authors: M. Jansson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

In some applications the covariance matrix of the observations is not only symmetric with respect to its main diagonal but also with respect to the anti-diagonal. The standard forward-only sample covariance estimate does not impose this extra symmetry. In such cases one often uses the so-called forward-backward sample covariance estimate. In this paper, a direct comparative study of the relative accuracy of the two sample estimates is performed. An explicit expression for the difference between the estimation error covariance matrices of the two sample estimates is given. The presented results are also useful in the analysis of estimators based on either of the two sample covariances. As an example, spatial power estimation by means of the Capon method is considered. It is shown that Capon based on the forward-only sample covariance (F-Capon) underestimates the power spectrum, and also that the bias for Capon based on the forward-backward sample covariance is half that of F-Capon.
A Simulation Model to Evaluate Decision Rules for Lock Operations on the Upper Mississippi River
Authors: L. Douglas Smith, Donald C. II Sweeney, James F. Campbell
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We describe a discrete-event simulation model used to investigate the impact of alternative decision rules for operations in a congested section of the Upper Mississippi River navigation system. The model accommodates commercial vessels with different barge-tow configurations and recreational vessels. Activities vary by time of year, day of week and time of day. We reveal potential benefits of alternative priority dispatching rules and show their differential impact on vessels with different tow configurations.
Chemical and Biological Applications of Digital-Microfluidic Devices
Authors: Richard B. Fair, Andrey Khlystov, Tina D. Tailor, Vladislav Ivanov, Randall D. Evans, Vijay Srinivasan, Vamsee K. Pamula, Michael G. Pollack, Peter B. Griffin, Jack Zhou
Venue: IEEE Design Test (2007)

The advent of digital microfluidic lab-on-a-chip (LoC) technology offers a platform for developing diagnostic applications with the advantages of portability, reduction of the volumes of the sample and reagents, faster analysis times, increased automation, low power consumption, compatibility with mass manufacturing, and high throughput. Moreover, digital microfluidics is being applied in other areas such as airborne chemical detection, DNA sequencing by synthesis, and tissue engineering. In most diagnostic and chemical-detection applications, a key challenge is the preparation of the analyte for presentation to the on-chip detection system. Thus, in diagnostics, raw physiological samples must be introduced onto the chip and then further processed by lysing blood cells and extracting DNA. For massively parallel DNA sequencing, sample preparation can be performed off chip, but the synthesis steps must be performed in a sequential on-chip format by automated control of buffers and nucleotides to extend the read lengths of DNA fragments. In airborne particulate-sampling applications, the sample collection from an air stream must be integrated into the LoC analytical component, which requires a collection droplet to scan an exposed impacted surface after its introduction into a closed analytical section. Finally, in tissue-engineering applications, the challenge for LoC technology is to build high-resolution (less than 10 microns) 3D tissue constructs with embedded cells and growth factors by manipulating and maintaining live cells in the chip platform. This article discusses these applications and their implementation in digital-microfluidic LoC platforms.
High-end workstation compute farms using windows NT
Authors: Srinivas Nimmagadda, Joshua LeVasseur, Rumi Zahir
Venue: Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3 (1999)

This paper describes our experiences in building and deploying Windows NT* based high-end workstation compute farms within the Intel engineering community. An overview of Intel's compute requirements is presented, along with the solution developed to address Intel's large compute cycle needs. The paper discusses NT's contribution to the solution, including recognized NT strengths as well as migration and deployment challenges we faced. The paper emphasizes workarounds to known issues for other user communities to leverage, but also enumerates areas in which Windows NT and the Win32 API* could be improved. Our paper concludes that despite many challenges, NT based high-end workstation farm computing is viable.
Stability and Convergence of the Crank-Nicolson/Adams-Bashforth scheme for the Time-Dependent Navier-Stokes Equations
Authors: Yinnian He, Weiwei Sun
Venue: SIAM Journal on Numerical Analysis (2007)

In this paper, we study the stability and convergence of the Crank-Nicolson/Adams-Bashforth scheme for the two-dimensional nonstationary Navier-Stokes equations. A finite element method is applied for the spatial approximation of the velocity and pressure. The time discretization is based on the Crank-Nicolson scheme for the linear term and the explicit Adams-Bashforth scheme for the nonlinear term. Moreover, we present optimal error estimates and prove that the scheme is almost unconditionally stable and convergent, i.e., stable and convergent when the time step is less than or equal to a constant.
Building intrusion tolerant applications
Authors: Thomas Wu, Michael Malkin, Dan Boneh
Venue: Proceedings of the 8th conference on USENIX Security Symposium - Volume 8 (1999)

The ITTC project (Intrusion Tolerance via Threshold Cryptography) provides tools and an infrastructure for building intrusion tolerant applications. Rather than prevent intrusions or detect them after the fact, the ITTC system ensures that the compromise of a few system components does not compromise sensitive security information. To do so we protect cryptographic keys by distributing them across a few servers. The keys are never reconstructed at a single location. Our designs are intended to simplify the integration of ITTC into existing applications. We give examples of embedding ITTC into the Apache web server and into a Certification Authority (CA). Performance measurements on both the modified web server and the modified CA show that the architecture works and performs well.