ppxscal/embedding_network huggingface dataset:
e-learning using e-learning
Authors: Marco Nordmann
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

During the last winter term of 2006 we offered our students a course about e-learning for the first time. 11 students participated. The content of this course was to teach the main aspects of e-learning like the didactical and historical background, e-learning technologies and strategies, multimedia and authoring software typically used to produce e-learning applications, the use of a learning platform offering downloads, communication, collaboration, web based training (WBT), online testing etc. We think, the best way of teaching e-learning means to use e-learning methods in combination with the well established concept of conventional presence lecturing using Powerpoints or a whiteboard. Together with computer based training (CBT) for homework, our course should be a good example for the blended learning concept, not only enriching but also integrating many e-learning concepts. This paper sketches the curriculum, arrangement, and findings of our course. Chapter 2.7 might be of special interest, because it describes how we discovered the positive influence of good CBT design and layout on the students learning effect.
Automatic translation of scholarly terms into patent terms
Authors: Hidetsugu Nanba, Hideaki Kamaya, Toshiyuki Takezawa, Manabu Okumura, Akihiro Shinmori, Hidekazu Tanigawa
Venue: Proceeding of the 2nd international workshop on Patent information retrieval (2009)

For a researcher in a field with high industrial relevance, retrieving research papers and patents has become an important aspect of assessing the scope of the field. However, retrieving patents using keywords is a laborious task for researchers, because the terms used in patents are often more abstract than those used in research papers, to try to widen the scope of the claims. We propose two methods for translating scholarly terms into patent terms: the "citation-based method" and the "thesaurus-based method". We also propose a method combining these two with the existing "Mase's method". To confirm the effectiveness of our methods, we conducted some examinations, and found that the combined method performed the best.
Mapping rearrangement for HARQ based on low-order modulation
Authors: Leszek Szczecinski, Andres Ceron, Rodolfo Feick
Venue: IEEE Transactions on Communications (2009)

In this paper we consider hybrid automatic repeat request transmission based on binary phase shift keying modulation. Our objective is to improve the performance of the retransmissions, keeping at the same time the complexity and the performance of the first transmission unaltered. We conclude that the so-called mapping rearrangement (MR) may considerably improve the performance if multi-dimensional modulation is applied. We evaluate the theoretical limits of bit-interleaved coded modulation with MR, verify the functioning of the practical coding scheme, and propose to improve the performance via iterative detection-decoding (BICM-ID) which brings considerable gains. In particular, for high coding rates, a 4 dB SNR gain over transmission without MR may be achieved.
Resource Cost Analysis of Intrusion Tolerance
Authors: Huawang Qin, Yuewei Dai, Zhiquan Wang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

The resource cost of intrusion tolerance is analyzed quantitatively. The concepts of steady cost and transient cost of intrusion tolerant system are proposed basing on the classification of intrusion tolerant measures. Reference to the computational method of the information entropy in information theory, the computational formula of steady cost is given. The function of the transient cost and the intrusion time is obtained according to the distributive property between the intrusion time and the intrusion probability, and the transient cost is described intuitively through computing its mathematical expectation. Lastly, some characteristics of the transient cost are analyzed through simulation, and some methods and notes of reducing the transient cost are given basing on the analysis result.
A hybrid decoder for block turbo codes
Authors: A. Al-Dweik, S. Le Goff, B. Sharif
Venue: IEEE Transactions on Communications (2009)

We propose a novel iterative decoder for block turbo codes (BTCs). The proposed decoder combines soft-input/soft-output (SISO) and hard-input/hard-output (HIHO) constituent decoders in order to obtain better error performance and reduce the computational complexity compared to classical BTC decoders. We show that the new decoder, called 'hybrid decoder', offers a better complexity/performance tradeoff than a classical BTC decoder.
Joint pricing and ordering policy for a deteriorating inventory
Authors: S. Mukhopadhyay, R. N. Mukherjee, K. S. Chaudhuri
Venue: Computers and Industrial Engineering (2004)

An inventory model is developed for a deteriorating item with a price-dependent demand rate. The rate of deterioration is taken to be time-proportional and a power law form of the price-dependence of demand is considered. The model is solved analytically and is illustrated with a numerical example.
College basketball scheduling with travel swings
Authors: Tim Van Voorhis
Venue: Computers and Industrial Engineering (2005)

The Missouri Valley Conference uses travel swings, in which a team plays two opponents during one road trip, to reduce the expenses for their college basketball programs. While these swings are financially beneficial, they significantly complicate the scheduling process. In particular, the swings alter the structure of the schedule by allowing games to occur outside of the standard time slots into which games are typically assigned. An integer programming formulation was developed that incorporates these swings into the scheduling problem. This program was solved efficiently by assigning swings first, then fitting remaining games around the swings. This generated a large number of candidate schedules, one of which was used for the 2001 season.
Turbo equalization with cancelation of nonlinear distortion for CP-assisted and zero-padded MC-CDM schemes
Authors: Rui Dinis, Paulo Silva, Teresa Araújo
Venue: IEEE Transactions on Communications (2009)

In this paper, we consider MC-CDM schemes (MultiCarrier Code Division Multiplexing) where clipping techniques are employed to reduce the envelope fluctuations of the transmitted signals. Both CP-assisted (Cyclic Prefix) and ZP (Zero-Padded) MC-CDM schemes are studied. We develop frequency-domain turbo equalizers combined with an iterative estimation and cancelation of nonlinear distortion effects, with relatively low complexity since they allow FFT-based (Fast Fourier Transform), frequency-domain implementations. Our performance results show that the proposed receivers allow significant performance improvements at low and moderate SNR (Signal-to-Noise Ratio), even when strongly nonlinear transmitters are employed. The receiver for ZP MC-CDM is of special interest for systems where the duration of the channel impulse response is not a small fraction of the duration of the MC-CDM blocks, being suitable to MC-CDM systems with very large blocks (hundreds or even thousands of subcarriers), since they do not require the inversion nor the multiplication of large matrixes.
Hash Function with Variable Output Length
Authors: JongHo Ryu, JungChan Na
Venue: Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDC (2009)

A hashing function is the mathematically complex algorithm that compresses an arbitrary input message into a fixed-length value, and it can be applicable for providing the message integrity and user message authentication service in the field of the various computer communications. Secure hashing function should have the following properties, such as one-wayness, collision-free and high-speedy behavior. In this paper, we propose a secure hashing algorithm which has a variable output length of 128, 160, 192, 224, 256 bits-length for practical applications. This hashing algorithm processes the input message blocks in 1024-bits, and is processed very fast by deploying the computational array effectively. Our proposed algorithm is promoted with respect to the efficiency and security compared with existing hash algorithm, since it satisfies 0-1 balancedness, high non-linearity, in equivalent in structure, mutually uncorrelated and SAC(Strict Avalanche Criterion).
Impact of delayed arbitrary transmit antenna selection on the performance of rectangular QAM with receive MRC in fading channels
Authors: Redha M. Radaydeh
Venue: IEEE Communications Letters (2009)

Constrained switching rate imposes practical limitations on the effectiveness of selection combining diversity algorithms. This paper investigates the impact of delayed arbitrarily-ordered transmit antenna selection on the average symbol error probability (SEP) performance of arbitrary rectangular quadrature amplitude modulation (QAM) with receive maximal ratio combining (MRC) diversity. New closed form expression is presented for the system average SEP considering the case of statistically independent diversity branches over which the instantaneous fading-to-noise power ratios follow Gamma distributions.
Applying an Enhanced Algorithm for Mining Incremental Updates on an Egyptian Newspaper Website
Authors: Laila Mohamed El Fangary
Venue: Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDC (2009)

Abstract—This paper presents new approaches for analyzing Egyptian Newspaper websites and presenting the most interesting topics that attract the largest portion of reading population to their newspaper website. The paper also presents techniques used for text and news mining. We first start with topic detection and tracking techniques to collect the reader website navigation data for the various topics then we use the proposed incremental algorithm (PIA), our previously published algorithm that was implemented in our previous researches, for mining of the news database. The paper concludes with significant results for identifying the readers trends, thus can dynamically display the most expected and required headline topics to the reader. The paper discovers also the most important topics for the users. Moreover, the paper had a significant effect for guiding the newspaper for the appropriate method for modifying its website to be dynamic according to the user interests specified by the association rules algorithm. We believe that this work had high impact in increasing the number of visitors for the newspaper website and attracting the reader's attention.
On high-rate full-diversity 2 × 2 space-time codes with low-complexity optimum detection
Authors: Serdar Sezginer, Hikmet Sari, Ezio Biglieri
Venue: IEEE Transactions on Communications (2009)

The 2 × 2 MIMO profiles included in Mobile WiMAX specifications are Alamouti's space-time code (STC) for transmit diversity and spatial multiplexing (SM). The former has full diversity and the latter has full rate, but neither of them has both of these desired features. An alternative 2×2 STC, which is both full rate and full diversity, is the Golden code. It is the best known 2×2 STC, but it has a high decoding complexity. Recently, the attention was turned to the decoder complexity, this issue was included in the STC design criteria, and different STCs were proposed. In this paper, we first present a full-rate full-diversity 2 × 2 STC design leading to substantially lower complexity of the optimum detector compared to the Golden code with only a slight performance loss. We provide the general optimized form of this STC and show that this scheme achieves the diversity-multiplexing frontier for square QAM signal constellations. Then, we present a variant of the proposed STC, which provides a further decrease in the detection complexity with a rate reduction of 25% and show that this provides an interesting trade-off between the Alamouti scheme and SM.
A Watermark Extraction Model to Enhance the Correlation of Digimarc Plug-ins in Photoshop
Authors: Li Li, Hehuan Xu, Chin Chen Cheng
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

Considering the watermark as a noise, a watermark extraction model is proposed in this paper to enhance the correlation of Digimarc plug-ins in Photoshop. First, an estimation of the original image for a watermarked image is obtained by TV (Total Variation) denoising model based on the Partial Differential Equation. Second, watermark noise information is obtained by subtraction between the watermarked image and the estimated one. Finally, the correlation of watermark can be improved by magnifying the watermark noise. The experimental results show that the new watermark extraction model can enhance the correlation of the Digimarc plug-ins although its watermarking method is unknown.
Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry
Authors: Cristovao Silva, Jose M. Magalhaes
Venue: Computers and Industrial Engineering (2006)

In this paper, we present an industrial problem found in a company that produces acrylic fibres to be used by the textile industry. The problem is a particular case of the discrete lot sizing and scheduling problem (DLSP). In this problem, lots of similar products must be generated and sequenced in ten unrelated parallel machines, in order to minimize tool changeovers and the quantity of fibre delivered after the required due date. The company problem is original because a changeover can occur between two lots of the same product due to tool wear. We analyse the problem in detail and present an adaptation of a heuristic found in the literature to solve it. Results obtained with the proposed heuristic are compared with results that used to be obtained by the production planner, using historical data.
An Approach for Model Composition and Verification
Authors: Defen Zhang, Shixian Li, Xianming Liu
Venue: Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDC (2009)

Model composition is frequently used during large software development in MDE (Model Driven Engineering). The consistency of the composed model is quite essential to model composition. This paper presents a weaving-based model composition framework (WMCF) and then gives a prototype implementation of the framework using Alloy language. Models are converted into Alloy codes and model composition is verified by the Alloy Analyzer.
Point-in-polygon tests for geometric buffers
Authors: Matej Gombosi, Borut alik
Venue: Computers Geosciences (2005)

The point-in-polygon problem is often encountered in geographical information systems. The algorithms usually work on polygons defined by straight edges. In some situations, however, polygons containing circular arcs are applied. In geographical information systems these polygons are usually considered as geometric buffers, geodesic offsets, or geodesic parallels. This paper presents three algorithms suitable for providing information about the containment of a point in geometric buffers: the Ray-crossing method, the Cell-Based Algorithm and the Approximate approach. An extensive experimental section allows the reader to select the most efficient algorithm for practical problems.
Accurate hidden Markov modeling of packet losses in indoor 802.11 networks
Authors: Kleber Vieira Cardoso, José Ferreira De Rezende
Venue: IEEE Communications Letters (2009)

This article presents an analysis of packet losses in IEEE 802.11 networks under indoor environment constraints, and shows how the Gilbert-Elliot model fails to represent packet losses in such networks. As an alternative, we propose a simple hidden Markov model (HMM) with a birth-death structure, which describes with sufficient accuracy the mean packet loss rate, variance, length of loss bursts, and process autocorrelation.
A new framework to automate constrained microaggregation
Authors: Isaac Cano, Guillermo Navarro-Arribas, Vicenç Torra
Venue: Proceeding of the ACM first international workshop on Privacy and anonymity for very large databases (2009)

Data protection methods from privacy preserving data mining and statistical disclosure control can introduce perturbation in the data. While this perturbation helps to protect the privacy of the respondents, it can introduce inconsistencies and errors. Moreover, the data are normally edited after collection to ensure its correctness and fix inconsistencies, and perturbation methods can introduce new errors in such data. In this paper we present a framework to automate the protection of data with a perturbative method, microaggregation, while at the same time ensuring that no inconsistencies and errors are introduced. That is, the data are microaggregated preserving a set of given constraints (edit constraints).
Design of practical optimum JIT systems by integration of computer simulation and analysis of variance
Authors: A. Azadeh, B. Bidokhti, S. M. R. Sakkaki
Venue: Computers and Industrial Engineering (2005)

This study introduces a framework for re-design of manufacturing systems into practical optimum just-in-time systems by integration of computer simulation and analysis of variance. The conventional JIT approach is mostly applicable to static production systems and the dynamic production systems require a more practical integrated JIT approach. In addition, the re-design of existing dynamic systems into just-in-time systems must follow a practical path, which can be a cumbersome task. This means, a unique practical optimum just-in-time system that considers system's limitations and its dynamic behavior must be designed. To achieve the objective of this study, first, the actual system must be totally modeled and simulated. Second, the integrated simulation model is tested and validated by analysis of variance. Third, the optimum (most fitted) JIT design is developed and tested by modeling actual system's limitations and its dynamic behavior. The framework is applied and tested for an auto production line and a heavy rolling mill workshop.
The reduction of the duration of the transient response in a class of continuous-time LTV filters
Authors: Miguel Ángel Gutiérrez De Anda, Arturo Sarmiento Reyes, Luis Hernández Martínez, Jacek Piskorowski, Roman Kaszynski
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

Linear time-varying (LTV) systems have found a niche of their own in the processing of continuous-time signals. In this brief, it is shown how the reduction of the duration of the transient response of a class of continuous-time LTV filters may be seen as the combined effect of the increased dampening of its amplitude response and the increase of the instantaneous frequency of its damped oscillations. For this aim, an LTV system whose damping factor and the damped frequency of its oscillations may be specified as functions of time is used as a vehicle of study. Time-varying eigenvalues are used to assess the behavior of the proposed system. Simulation results are used to verify the proposed mechanism behind the reduction of the duration of the transient response in the LTV filters under study.
An Improved Identity-Based Society Oriented Signature Scheme
Authors: Zuowen Tan
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

In a society oriented signature scheme, a signature is produced by several co-signers simultaneously in a group. Saeednia proposed an identity-based society oriented signature scheme. However, there are some security weaknesses in the scheme. Zhu and Wang et al. showed two different attacks against the identity-based society oriented signature scheme respectively. In this paper, we proposed an improved identity-based society signature scheme with anonymous signers. The proposed identity-based society signature scheme removed the weaknesses of Saeednia's signature scheme. A detailed analysis demonstrated that the improved scheme is secure against all the attacks above-mentioned. In addition, when the structure of a group changes or a group represents different organizations to sign messages at the same time, the improved scheme won't reveal the secret key of any entity or even the value of the ratio of two secret keys. Our scheme doesn't require that the clerk must be a trusted and online party.
Construction of an e-learning portal by use of NetCommons
Authors: T. Zhang, S. Chen, N. Teraguchi, N. Arai
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

This paper introduces the construction of an e-Learning portal by use of NetCommons. NetCommons is designed for small-scale active communities to share information on WWW securely. It provides plenty of functions for various purposes. In the paper, we construct an e-Learning portal for the Laboratory & Experimental Research Center, Department of Automation, Tsinghua University. Based on the requirements from the education activities in the center, this e-Learning portal defines several modules. By use of this portal in the center, the effectiveness of NetCommons is verified. In addition, we provide several suggestions for the improvement of NetCommons in the future.
Steganography in Handling Oversized IP Packets
Authors: Wojciech Mazurczyk, Krzysztof Szczypiorski
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

This paper identifies new class of network steganography methods that utilize mechanisms for handling oversized IP packets: IP fragmentation, PMTUD (Path MTU Discovery) and PLPMTUD (Packetization Layer Path MTU Discovery). In particular, for these mechanisms we propose two new steganographic methods and three extensions of existing ones. We present how mentioned mechanisms can be used to enable hidden communication for both versions of IP protocol: 4 and 6. Also the detection of the proposed methods is enclosed in this paper.
A multi-body dynamics approach to a cable simulation for kites
Authors: J. Breukels, W. J. Ockels
Venue: Proceedings of the IASTED Asian Conference on Modelling and Simulation (2007)

For the purpose of ultimately building a fully dynamic simulation of kites, an investigation is launched into a viable model of the cable with which the kite is attached to the ground. In the model proposed in this paper, only the slow modes of motion are taken into account due to the fact that only the slow motions have a real effect on the flight characteristics of the kite. Fast vibrations have a low amplitude with little effect. Also, by taking out all the fast modes of motion, the time step for integration can remain fairly large, speeding up the calculation process. Of special interest in the model is the damping which consists of aerodynamic damping and material-based damping. The relation between these two forms of damping is investigated. Verification of the model is done through comparison with analytical and real-life measured data. The resulting model is simulated in MSC ADAMS. It is shown that the aerodynamic damping is of prime interest because it dampens the slower motions. Material damping dampens mostly the fast vibrations.