ppxscal/embedding_network huggingface dataset:
The effectiveness of computer-aided learning for VRML
Authors: Anthony K. L. Wong
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

This paper describes the development and evaluation of a computer-aided learning (CAL) package for an undergraduate subject -- Web 3D Technologies. The CAL package, known as eTute is accessed via the World Wide Web (WWW) to provide portable, usable and accessible subject material. The eTute is offered as an educational supplement to a conventional lecture. Summaries from the conventional lecture are provided in the package. The eTute incorporates interactive examples with navigational aid and instructional procedures for demonstration purpose and self-paced learning. It also includes interactive assessments for students' self-evaluation. The package has been evaluated on a group of undergraduates learning Virtual Reality Modeling Language (VRML) in Web 3D Technologies subject. The eTute is interesting, comprehensive, yet easy to use. It is suitable for students of all levels, whether they are a slow learner or a fast learner. Most students show significant improvement in the CAL approach. Results have proven that the CAL approach has motivated students and improved their problem solving skills. The student evaluations have reflected that many students prefer CAL approach over other approaches. Computer functionalities like interactivity and usability are the keys to achieving the objective of this research. This research has proven the effectiveness of using CAL for VRML.
GCLgrid: A three-dimensional geographical curvilinear grid library for computational seismology
Authors: Chengliang Fan, Gary L. Pavlis, Kagan Tuncay
Venue: Computers Geosciences (2006)

We developed a general library for handling a class of objects we call geographical curvilinear grids (GCLgrids). A GCLgrid is a distorted, uniform grid that is georeferenced. The GCLgrid library is implemented in an object oriented system with methods that relate points in the grid to a geographic reference frame. A simple example is a spherical shell divided along latitude, longitude, and depth, but more elaborate shapes can use the same interface. Scalar and vector fields are derived from the base grid through inheritance. Two algorithms are the core of this library. First, we use the Direction Set method to search for a location in space from a starting point. This algorithm converges reasonably fast if the grid is not extremely distorted. Second, we interpolate the grid using methods known from finite element analysis. A Jacobian matrix for an 8-node cube is computed to transform a distorted cube into a unit one. Shape functions for the standard cube are used to compute interpolation coefficients. Once the interpolation coefficients are computed, we can interpolate n-element vectors almost as quickly as scalar data. We show an application of the library to travel time table calculation at regional distances. Our table interpolator was found to be 10 times faster than one based on the tau-p method and is expected to be several orders of magnitude faster than 3D ray-tracing methods. Travel time interpolation errors are reduced significantly by tabulating delay times relative to a homogenous reference model instead of absolute times. This allows much coarser grids to be used at large scales comparing to one using total time.
Efficient computation of symbol statistics from bit a priori information in turbo receivers
Authors: Jianfeng Liu, Hilde Vanhaute, Marc Moonen, André Bourdoux, Hugo De Man
Venue: IEEE Transactions on Communications (2009)

In this paper, an efficient computational scheme is proposed to calculate the symbol mean and variance from bit a priori information, when a so-called multilinear mapping is employed. The multilinear mapping is exploited to reduce the number of the terms needed for the calculation of the symbol mean and variance.
Improving the marking of programming exercises using a marking support tool and subject design
Authors: Saeko Matsuura
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

Since 2003, we have strived to determine the most appropriate method for improving students' programming skills. One reason for this research is that the evaluation of programs requires sufficient time and careful consideration of correctness, fairness, and appropriateness. Another reason is that programming should always be evaluated on the grounds of not only compilation and testing but also correctness of the algorithm and validity of the model. Due to various factors, even if students submit their programs electronically, it does not contribute to improving the correctness of the evaluation in terms of marking their programs. Moreover, a lack of concrete assessment items and criteria for the programs implies that the marked results will depend on the instructor's assessment. To reduce the extent to which assessment results depend on the instructor, we propose the introduction of subject design in our programming exercises. We have developed a marking support tool that enables us to evaluate programs on one screen where we can readily compile and test the program, browse the code, record the student's marks, and analyze assessment results. This research sought to improve the assessment of programming exercises using support design and the marking support tool that we developed.
A unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields
Authors: Shumei Song, Bo Zhou, Shu Lin, Khaled Abdel-Ghaffar
Venue: IEEE Transactions on Communications (2009)

A unified approach for constructing binary and nonbinary quasi-cyclic LDPC codes under a single framework is presented. Six classes of binary and nonbinary quasi-cyclic LDPC codes are constructed based on primitive elements, additive subgroups, and cyclic subgroups of finite fields. Numerical results show that the codes constructed perform well over the AWGN channel with iterative decoding.
Volume-preserving space deformation
Authors: Fabrice Aubert, Dominique Bechmann
Venue: Computers and Graphics (1997)

Space deformations or free-form deformations techniques are a powerful tool to manipulate and to animate objects. Various extensions of these techniques allow a user to intuitively deform objects, but none of these propose a solution to preserve the volume of objects throughout the deformation. This paper introduces a new method to deform an object, its volume being preserved. Our method is based on the space deformation model called DOGME. We use a distinctive feature of DOGME to solve the problem of volume preservation. Polyhedral objects which are currently used in geometric modeling are considered and we obtain excellent results in a fully intuitive and interactive environment.
Research of Game of Supply Chain Coordination in the Condition of the Uncertain Delivery
Authors: XianWu Zeng
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 01 (2009)

The supply chain coordination game in the condition of uncertain delivery is studied, the model of the cost and profit of supplier and producer are proposed, which property of the profit model is concave function and that have maximum. And while, the leader-follower game of Stackelberg between supplier and producer is studied, which is declared that profit obtained by Stackelberg game can be more than completely independent game in the research. The results are indicated that supply chain coordination mechanism can be obtained more profit for the supply chain members.
Antenna selection and power control in MIMO systems with continuously varying channels
Authors: Ramakrishna Yellapantula, Yingwei Yao, Rashid Ansari
Venue: IEEE Communications Letters (2009)

Existing limited feedback methods for Multiple-Input Multiple-Output (MIMO) systems focus largely on block fading conditions whereas, in practice, channels change continuously over time. In this paper, we investigate adaptive transmission over a continuously varying channel (CVC). A combination of Kalman channel tracking, truncated channel inversion (TCI) antenna selection, and power control, is used to achieve bit error rates that are lower than those obtained with existing schemes. Using Kalman filtering for pilot-based channel tracking as well as decision-directed channel tracking, our scheme achieves about 3.6dB gain over the eigen-mode antenna selection scheme and 1.5dB gain over the unitary precoding scheme, when operating at a BER of 10-5.
Welcome A-Board
Authors: David H. Albonesi
Venue: IEEE Micro (2009)

IEEE Micro Editor in Chief David H. Albonesi welcomes six new emmbers to teh IEEE Micro Editorial Board and previews this general interest issue.
Asymptotic analysis of space-time codes in generalized fading channels
Authors: Ali Nezampour, Robert Schober
Venue: IEEE Communications Letters (2009)

Considering the practically important case of two transmit and an arbitrary number of receive antennas, we provide a simple closed-form expression for the asymptotic pairwise error probability (PEP) of space-time codes (STCs) in generalized fading including Rayleigh, Ricean, Nakagami-q, Nakagami-m, Weibull, and generalized-K fading. The presented analysis provides new insights into STC design and can be used to obtain tight asymptotic upper bounds for the bit, symbol, and frame error probabilities of arbitrary STCs.
New synchronization stability of complex networks with an interval time-varying coupling delay
Authors: Zhongyang Fei, Huijun Gao, Wei Xing Zheng
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

In this brief, the problem of synchronization stability analysis for complex dynamical networks with a time-varying coupling delay is studied. The delay considered in this brief is assumed to vary over an interval where the lower and upper bounds are known. By dividing the interval time-varying delay into a constant and a time-varying part and using a delay-partitioning approach, a new Lyapunov-Krasovskii functional is constructed. Based on this, a new delay-range-dependent criterion is obtained in terms of linear matrix inequalities. A numerical example is provided to show the effectiveness of the proposed results.
Toward optimizing Cauchy matrix for Cauchy Reed-Solomon code
Authors: Xiangxue Li, Qingji Zheng, Haifeng Qian, Dong Zheng, Jianhua Li
Venue: IEEE Communications Letters (2009)

The computational costs of Cauchy Reed-Solomon (CRS) encoding operation make a great impact on the performance of its practical applications. The letter concentrates on how to construct a good Cauchy matrix which can lead to an efficient CRS coding scheme. We first formally model the problem by using a binary quadratic programming, then present an approximate method called localized greedy algorithm (LGA) to solve it. Compared with existing work, LGA requires much lower complexities to obtain the same performance of Cauchy matrices.
Proceeding of the 1st international CIKM workshop on Topic-sentiment analysis for mass opinion
Venue: Conference on Information and Knowledge Management (2009)

It is our great pleasure to welcome you to the 1st International CIKM Workshop on Topic-Sentiment Analysis for Mass Opinion Measurement -- TSA'09. This workshop seeks to bring together researchers in both computer science and social sciences who are interested in developing and using topic-sentiment analysis methods to measure mass opinion, and to foster communications between the research community and industry practitioners as well. The call for papers attracted 21 submissions from 14 countries. The program committee accepted 12 papers that cover a variety of topics, including topic-sentiment modeling, sentiment classification and retrieval, sentiment corpus construction, and applications of topic-sentiment analysis in text summarization, question answering, and recommender systems. The proposed approaches analyze opinions at all levels of granularity: clause, sub-sentence, sentence, paragraph and document. Most of the approaches combine machine learning and statistical methods and the use of linguistic resources (sentiment lexicons, syntactic rules, etc.) for sentiment identification. User-generated content (UGC) is still the main source of data for topic-sentiment analysis in various domains, like customer reviews, blogs, and discussion boards. In addition to English, corpora of other languages (Chinese, Spanish, and Portuguese) have also been studied. Many authors chose to manually annotate their own sentiment corpora to train machine learning algorithms, or employed automatic methods to acquire the sentiment annotation. This indicates the strong demand for large volume of annotated data in various topics and domains to facilitate topic-sentiment analysis.
WLS design of variable fractional-delay FIR filters using coefficient relationship
Authors: Yun-Da Huang, Soo-Chang Pei, Jong-Jy Shyu
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

In this brief, a new coefficient relationship is proposed for the design of variable fractional-delay (VFD) finiteimpulse response (FIR) filters by the weighted least-squares (WLS) method so that the number of filter coefficients to be designed can approximately be halved. To reduce the computational cost, closed-form expressions for the elements of related vectors and matrices are derived. Several design examples are presented, and the comparisons show that the overall performance of the proposed method is comparable with that of the conventional method; however, the number of filter coefficients to be designed for the proposed method is about half of that in the conventional method.
Exploring the feasibility of reputation systems under churn
Authors: Marc Sánchez-Artigas, Pedro García-López, Blas Herrera
Venue: IEEE Communications Letters (2009)

This letter examines how high rates of churn--the continuous process of node arrival and departure--affect rating mechanisms for peer-to-peer (P2P) networks. In particular, short peer lifetimes mean reputations are often generated from a small number of transactions, and thus are few reliable. To understand this relationship, this letter introduces an analytical model which determines the optimal transaction rate and the expected time to produce a reliable reputation, under both exponential and Pareto lifetime distributions.
Reversible Digital Watermarking with Block Linking
Authors: Chi-Man Pun, Nopporn Hemman
Venue: Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDC (2009)

This paper proposes a novel reversible digital watermarking algorithm by block linking. First the input image is decomposed by a reversible integer transform. The expandable values for data embedding is divided into blocks which are linked by index. The location map is avoided to increase the capacity for embedding. The experimental results show that our proposed method can reverse the marked image pixels back to the original values without the use of location map and can achieve higher capacity.
The semi-automated classification of sedimentary organic matter in palynological preparations
Authors: Andrew F. Weller, Jonathan Corcoran, Anthony J. Harris, J. Andrew Ware
Venue: Computers Geosciences (2005)

The capture, analysis and classification of sedimentary organic matter in palynological preparations have been semi-automated. First, the morphological and textural discriminatory features used in classification schemes are measured using a computer-controlled stage and a digital camera mounted on a microscope in combination with Halcon image analysis algorithms. Second, the Exhaustive CHi-square Automatic Interaction Detector classification tree algorithm is applied to all feature measurements to establish their saliency as classification discriminators. Thirdly, the results of the classification tree algorithm are used to determine the inputs used by the actual classifier, which consists of a series of artificial neural networks (ANNs). The Gamma test (GT) is introduced as a tool to help facilitate the best use of limited data and to ensure that the ANNs are not over trained. The results show that the system developed is able to achieve an average correct classification rate of 87%. This is encouraging enough to prompt further research that could result in a commercially viable system. In the future, work will concentrate on refining the image capture component of the system and increasing the size of those databases that have been shown both empirically and by the GT to be too small to facilitate the construction of accurate classifiers.
Multi-server retrial model with variable number of active servers
Authors: J. R. Artalejo, D. S. Orlovsky, A. N. Dudin
Venue: Computers and Industrial Engineering (2005)

This paper deals with a multi-server retrial queueing model in which the number of active servers depends on the number of customers in the system. To this end, the servers are switched on and off according to a multi-threshold strategy. For a fixed choice of the threshold levels, the stationary distribution and various performance measures of the system are calculated. In the case of equidistant connection levels, the optimum threshold level is numerically computed.
A family of likelihood ascent search multiuser detectors: approaching optimum performance via random multicodes with linear complexity
Authors: Yi Sun
Venue: IEEE Transactions on Communications (2009)

Tse and Verdú proved that the global maximum likelihood (GML) detector achieves unit asymptotic multiuser efficiency (AME) in the limit of large random spreading CDMA. In this paper, we show that the wide-sense sequential likelihood ascent search (WSLAS) detectors achieve unit AME with channel load < 1/2 - 1/(4 ln 2) bits/s/Hz. In simulations for random multicode equal-power systems, the WSLAS with a linear per-bit complexity approaches the GML BER in all SNR with channel load as high as 1.05 bits/s/Hz.
GeoSciML: Development of a generic GeoScience Markup Language
Authors: Marcus Sen, Tim Duffy
Venue: Computers Geosciences (2005)

The use of eXtensible Markup Language (XML) schema for geoscience data exchange is an improvement on non XML data formats because the XML format is partially self-documenting and provides common methods for parsing files, obtaining their structure and transforming them to alternative formats. The British Geological Survey (BGS) believes it is important to develop some common ML for the exchange of generic geoscience information. If communities share a common data transfer model for their domains of interest, data exchange becomes even easier and more likely to take place efficiently. To address this need the BGS is proposing the development of GeoSciML, a geoscience information markup language, as an application of the OpenGIS Consortium's (OGC) Geography Markup Language (GML), building upon the applied geoscience domain focused eXploration and Mining Markup Language (XMML). We are aiming for an open standard with the support of bodies such as the International Union of Geological Sciences' (IUGS) Commission for the Management and Application of Geoscience Information and the OGC. This paper illustrates the proposed approach with some initial development work to cover geoscientific domains of particular interest, such as boreholes, text and structural geology. The development process has been iterative, with successive prototypes incorporating the comments of experts in each geoscientific domain. We propose that development be extended to the wider geoscience community with the developing schemas and documentation available on a collaborative web site.
A general method to design GCF compensation filter
Authors: Alfonso Fernandez-Vazquez, Gordana Jovanovic Dolecek
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

This brief addresses the design of the compensation filter of a generalized comb filter (GCF). The proposed method is general and can be applied to different design constraints, i.e., maximally flat, least square, and minimax. The coefficients of the proposed filter for all three cases can be obtained by solving two simple linear equations. The filter operates at a low rate and considerably reduces the passband droop of the GCF.
Design and Implementation of a Mobile Phone Integrated Alarming-System
Authors: YunYan Liao, YinGen Yang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

This paper proposes a mobile phone integrated alarming-system, which has two models: mobile, fixed alarm-ways. The Alarming information contains local sound, video and GPS information. The system provides two ways of reading the alarming information: web ways and mobile alarming media player ways for instant checking or repeated watching and analysis .The real-time transmission of sound and video information is based on RTP/RTCP of using the adaptive flow control technology. System structure diagram, class diagram, use case diagram, collaboration diagram and activity diagram are presented in this paper.
FOLD PROFILER: A MATLAB®-based program for fold shape classification
Authors: R. J. Lisle, J. L. Fernández Martínez, N. Bobillo-Ares, O. Menéndez, J. Aller, F. Bastida
Venue: Computers Geosciences (2006)

FOLD PROFILER is a MATLAB code for classifying the shapes of profiles of folded surfaces. The classification is based on the comparison of the natural fold profile with curves representing mathematical functions. The user is offered a choice of four methods, each based on a different type of function: cubic Bezier curves, conic sections, power functions and superellipses. The comparison is carried out by the visual matching of the fold profile displayed on-screen from an imported digital image and computed theoretical curves which are superimposed on the image of the fold. To improve the fit with the real fold shape, the parameters of the theoretical curves are changed by simple mouse actions. The parameters of the mathematical function that best fits the real folds are used to classify the fold shape. FOLD PROFILER allows the rapid implementation of four existing methods for fold shape analysis. The attractiveness of this analytical tool lies in the way it gives an instant visual appreciation of the effect of changing the parameters that are used to classify fold geometry.
An interactive and open approach for the analysis and diffusion of geoscientific data
Authors: G. Descamps, P. Therrien, R. Therrien
Venue: Computers Geosciences (2006)

This paper presents APERTA, a Web-based tool for the diffusion and analysis of geoscientific data. The main feature differentiating APERTA from other Web-based data diffusion tools is that all output documents and graphics displayed are created each time a user makes a request. The databases queried by APERTA only have to store raw numerical data and the graphics are always generated from an up-to-date database. APERTA allows users to interactively analyze data on-line with standard statistical and geostatistical methods and produce various graphic documents commonly used in earth sciences such as semivariograms, contour maps and cross-sections. Another unique feature of APERTA, which is its most powerful, is that it lets the user decide how data are extracted and graphics are produced. According to their needs and to the type of data, users can thus select the data processing and the output documents required. Because they control processing, users are fully aware of the limits, accuracy and effects of processing on the graphical output. The purpose of APERTA is therefore not only to distribute data but to be a tool to quickly inspect data using an interactive document creation approach. The main features of APERTA are described here along with several examples of data analysis for hydrogeological, geochemical and geotechnical data.