ppxscal/embedding_network huggingface dataset:
Comparing computer-based instruction, preschool instruction, and supplementary reading material
Authors: Haya Shamir, Michael Crowther, Chelsea Sirrine
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

This study examined difference in children's scores as a function of the type of intervention they received. There were 218 preschool children who participated in one of three intervention groups: computer-based instruction plus supplementary reading material, traditional preschool instruction, and supplementary reading material only. Children were tested prior to and after treatment, and their improvement scores were compared. Results indicate that children in the computer-based instruction group improved their skills in phonological awareness, in reading words recognition, and in letter recognition significantly more compared to children in the traditional preschool instruction and to children in the supplementary reading material groups. Interestingly, children in the traditional preschool instruction and in the supplementary reading material group improved their vocabulary significantly more than the computer-based instruction group.
A learning algorithm based estimation method for maintenance cost of product concepts
Authors: Kwang-Kyu Seo, Beum Jun Ahn
Venue: Computers and Industrial Engineering (2006)

Life cycle concerns have been realized a major issue of increasing importance. Life cycle cost as analytical method has been developed to enable comprehensive cost analysis to improve economic performance of products during their life cycle. This paper present a learning algorithm based estimation method for maintenance cost as life cycle cost of product concepts. In order to develop the proposed method, we identify some attributes that represent corrective maintainability of product concepts and add them to the product attributes used to make a selection amongst product concepts. From the list of all the product attributes, 24 product attributes strongly correlated with maintenance cost are chosen. To estimate maintenance cost of product concepts, the selected product attributes are used as inputs and maintenance cost are used as outputs in a learning model based on based on artificial neural networks. The proposed approach does not replace the detailed cost estimation but it would give some cost-effective decision making for product concepts.
A channel coding approach for human authentication from gait sequences
Authors: Savvas Argyropoulos, Dimitrios Tzovaras, Dimosthenis Ioannidis, Michael G. Strintzis
Venue: IEEE Transactions on Information Forensics and Security (2009)

Human authentication using biometric traits has become an increasingly important issue in a large range of applications. In this paper, a novel channel coding approach for biometric authentication based on distributed source coding principles is proposed. Biometric recognition is formulated as a channel coding problem with noisy side information at the decoder and error correcting codes are employed for user verification. It is shown that the effective exploitation of the noise channel distribution in the decoding process improves performance. Moreover, the proposed method increases the security of the stored biometric templates. As a case study, the proposed framework is employed for the development of a novel gait recognition system based on the extraction of depth data from human silhouettes and a set of discriminative features. Specifically, gait sequences are represented using the radial and the circular integration transforms and features based on weighted Krawtchouk moments. Analytical models are derived for the effective modeling of the correlation channel statistics based on these features and integrated in the soft decoding process of the channel decoder. The experimental results demonstrate the validity of the proposed method over state-of-the-art techniques for gait recognition.
Modeling and evaluation of serial multicast remote procedure calls (RPCs)
Authors: Sang-Hoon Kim, Jin-Soo Kim, Seungryoul Maeng
Venue: IEEE Communications Letters (2009)

The need for serial multicast remote procedure calls (RPCs) arises in many distributed systems to avoid network bottlenecks and high-latency links, especially when the caller wants to send a large amount of data to multiple callees. In this paper, we present a mathematical model of serial multicast calls in order to understand their performance behavior. Through our evaluations on the real platform, we find our model is very effective in predicting the performance of serial multicast RPCs.
Short note: INVGRAFALT-A Fortran code for Marquardt inversion of gravity anomalies of faulted beds with varying density
Authors: V. Chakravarthi, N. Sundararajan
Venue: Computers Geosciences (2005)

@?
Aggregation of classifiers for staining pattern recognition in antinuclear autoantibodies analysis
Authors: Paolo Soda, Giulio Iannello
Venue: IEEE Transactions on Information Technology in Biomedicine (2009)

Indirect immunofluorescence is currently the recommended method for the detection of antinuclear autoantibodies (ANA). The diagnosis consists of both estimating the fluorescence intensity and reporting the staining pattern for positive wells only. Since resources and adequately trained personnel are not always available for these tasks, an evident medical demand is the development of computer-aided diagnosis (CAD) tools that can support the physician decisions. In this paper, we present a system that classifies the staining pattern of positive wells on the strength of the recognition of their cells. The core of the CAD is a multiple expert system (MES) based on the one-per-class approach devised to label the pattern of single cells. It employs a hybrid approach since each composing binary module is constituted by an ensemble of classifiers combined by a fusion rule. Each expert uses a set of stable and effective features selected from a wide pool of statistical and spectral measurements. In this framework, we present a novel parameter that measures the reliability of the final classification provided by the MES. This feature is used to introduce a reject option that allows to reduce the error rate in the recognition of the staining pattern of the whole well. The approach has been evaluated on 37 wells, for a total of 573 cells. The measured performance shows a low overall error rate (2.7%-5.8%), which is below the observed intralaboratory variability.
Halftone visual cryptography via error diffusion
Authors: Zhongmin Wang, Gonzalo R. Arce, Giovanni Di Crescenzo
Venue: IEEE Transactions on Information Forensics and Security (2009)

Halftone visual cryptography (HVC) enlarges the area of visual cryptography by the addition of digital halftoning techniques. In particular, in visual secret sharing schemes, a secret image can be encoded into halftone shares taking meaningful visual information. In this paper, HVC construction methods based on error diffusion are proposed. The secret image is concurrently embedded into binary valued shares while these shares are halftoned by error diffusion--the workhorse standard of halftoning algorithms. Error diffusion has low complexity and provides halftone shares with good image quality. A reconstructed secret image, obtained by stacking qualified shares together, does not suffer from cross interference of share images. Factors affecting the share image quality and the contrast of the reconstructed image are discussed. Simulation results show several illustrative examples.
Emerging clapping synchronization from a complex multiagent network with local information via local control
Authors: Deyi Li, Kun Liu, Yan Sun, Mingchang Han
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

Recently, complex multiagent networks have received increasing attention from various fields of science and engineering. Synchronization is a typical collective behavior of complex multiagent networks that has extensively been investigated over the last decade. To reveal the dynamical mechanism of synchronization in complex mnltiagent networks, a simple complex multiagent network with local information is then further investigated. Based on a suitable model, we analyze the inherent key factors in the emerging clapping synchronization. In particular, we explore two challenging fundamental questions: 1) How does the number of informed agents (or backbones) affect the emerging clapping synchronization? 2) How does the distribution of informed agents (or backbones) affect the emerging clapping synchronization? Our results indicate that the emerging clapping synchronization has a great diversity of routes, uncertainty, and adaptability. Moreover, our model and approach provide a possible route for analyzing the other collective behaviors of complex multiagent networks with local information via local control.
Extend the Service and Component in Meta-level for Pervasive Computing
Authors: Yang Yongzhi, Rao Xiang, Shi Dianxi, Zou Peng
Venue: Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering (2009)

Powerful and cheap computing devices are flooding the world, which arises the primary challenge for pervasive computing: how to represent devices and their functions without distracting user attention. Most existing pervasive computing platforms use traditional components and services as the answer. However, both of them have limitations. Existing services in the form of Interface are small in granularity, lacking of semantics and distracting to invoke remotely. Existing components are lacking of a unified model for representing dependencies and a mechanism for dealing with these dependencies, especially the runtime dependency. In this paper, we extend the Service and Component in meta-level for pervasive computing. Firstly, we extend them in meta-model, making the Service as the aggregation of Interface. Secondly, we entitle semantics to services by applying ontology and provide a new service invoking mechanism. Thirdly, we wrap Component by the enhanced Service to decouple the compile-time and runtime dependencies; and introduce a novel group interaction mechanism for multi-service interaction. Finally, a prototype platform which applies enhanced Service and Component is presented; and two demos are used to show how the extended Service and Component work and benefit. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Turbo receivers for interleave-division multiple-access systems
Authors: Bogdan Cristea, Daniel Roviras, Benoît Escrig
Venue: IEEE Transactions on Communications (2009)

In this paper several turbo receivers for Interleave-Division Multiple-Access (IDMA) systems will be discussed. The multiple access system model is presented first. The optimal, Maximum A Posteriori (MAP) algorithm, is then presented. It will be shown that the use of a precoding technique at the emitter side is applicable to IDMA systems. Several low complexity Multi-User Detector (MUD), based on the Gaussian approximation, will be next discussed. It will be shown that the MUD with Probabilistic Data Association (PDA) algorithm provides faster convergence of the turbo receiver. The discussed turbo receivers will be evaluated by means of Bit Error Rate (BER) simulations and EXtrinsic Information Transfer (EXIT) charts.
A General Trust Model Based on Trust Algebra
Authors: Wenzhong Yang, Cuanhe Huang, Bo Wang, Tong Wang, Zhenyu Zhang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

The growing importance of Trust in the realm of open network environment introduces further research on it, due to the special significance of trust to whole system. We view trust as a relation among entities that participate in an action meeting the trustor's own standards for an intended purpose. In this paper, we propose a trust algebra aiming to solving generic trust propagation and trust inference in trust graph and present a general trust model based on trust algebra. This paper also presents a general trust inference and trust evaluation algorithm based on trust algebra and trust model. Because of the natural uncertainty of trust, we also present an information entropy to quantitatively measure trust. Our trust algebra framework is shown to be flexible enough to express other trust models and our scheme is shown to be general in different computing environments because of abstract operators of trust algebra.
Collaborative filtering using random neighbours in peer-to-peer networks
Authors: Arno Bakker, Elth Ogston, Maarten van Steen
Venue: Proceeding of the 1st ACM international workshop on Complex networks meet information & knowledge management (2009)

Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized context where not all users' ratings can be available at all locations. In this paper we investigate how the well-known neighbourhood-based CF algorithm by Herlocker et al. operates on partial knowledge; that is, how many similar users does the algorithm actually need to produce good recommendations for a given user, and how similar must those users be. We show for the popular MovieLens 1,000,000 and Jester datasets that sufficiently good recommendations can be made based on the ratings of a neighbourhood consisting of a relatively small number of randomly selected users.
An object-oriented simulation framework for real-time control of automated flexible manufacturing systems
Authors: Ali Yalcin, Ravi Kalyan Namballa
Venue: Computers and Industrial Engineering (2005)

This paper describes an object-oriented simulation approach for the design of a flexible manufacturing system that allows the implementation of control logic during the system design phase. The object-oriented design approach is built around the formal theory of supervisory control based on Finite Automata. The formalism is used to capture inter-object relationships that are difficult to identify in the object-oriented design approach. The system resources are modeled as object classes based on the events that have to be monitored for real-time control. Real-time control issues including deadlock resolution, resource failures in various modes of operation and recovery from failures while sustaining desirable logical system properties are integrated into the logical design for simulating the supervisory controller.
The Comparisons Between Domestic and International Software Outsourcing Industry Growth Model
Authors: Haiwei Zhou, Xiquan Wang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

Domestic and international software outsourcing industry have common characteristics and the law of development. Therefore, both at home and abroad, especially compared to the software outsourcing in developed countries such as India, Ireland and other countries outsourcing model has become the primary guide for our outsourcing industry. Then there were significant differences between the industrial development and industrial structure. How should we use and learn from practice, which was based on the given path to a viable operation and programs. The model may be a good path.
M-PRMA protocol for vehicular multimedia communication
Authors: Bilal R. Qazi, Jaafar M. H. Elmirghani
Venue: International Journal of Communication Networks and Distributed Systems (2010)

Medium access control (MAC) protocols, responsible for sharing the channel among users, are receiving more attention especially in vehicular networks due to the highly dynamic nature of the environment in which they operate. Typically MAC protocols were designed for one traffic class such as voice, video or data as all of them have different characteristics. In this paper, we introduce a modified version of packet reservation multiple access namely M-PRMA MAC protocol for vehicular networks responsible for multimedia communication while maintaining quality of service (QoS) for each traffic class. We evaluate the performance of the MAC protocol in terms of packet dropping probability, average delay and throughput under a 3 &#215; 3 km Manhattan grid representing a typical modern city.
Improved Algorithm of Pattern Matching for Intrusion Detection
Authors: Zhen Liu, Su Xu, Jue Zhang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

Firstly pattern matching is briefly introduced in this paper, followed by the analysis of some typical algorithms just as BM algorithm, BMH algorithm, BMHS algorithm. Based on these analyses, a new improved algorithm is presented. The algorithm uses a matching way that is from two ends to the middle, and finds a character which can make a rightward shift larger, also can decrease the times of comparing and enhance the matching speed effectively. Experiments show that the algorithm is more effective when the pattern string is long.
Analytical study on the effect of cochannel interference on partially coherent diversity systems
Authors: Mahmoud A. Smadi, Vasant K. Prabhu, Saleh O. Al-Jazzar
Venue: IEEE Transactions on Communications (2009)

In this paper, we study the effect of cochannel interference (CCI) on the performance of partially coherent BPSK and QPSK in uncorrelated L-branch equal-gain combining systems. We consider a generalized propagation model wherein the desired and interfering signals undergo Nakagami-m or Rician fading with different amounts of fading severity. Further, the interfering signals are assumed to be asynchronous symbol timing with the desired signal, so that the effect of cross-signal intersymbol interference (ISI) is taken into account. Using a convergent Fourier series method, we derive extensive analytical results for the average bit error probability and the SNR gain penalty caused by the interference signals for different signal-to-interference ratio levels. The numerical results presented in this paper demonstrate the system performance under very realistic propagation and detection conditions including CCI, carrier phase error recovery, cross-signal ISI, generalized fading channels, and AWGN. Hence our results are expected to be of significant practical use for such scenarios.
Intra-cell manpower transfers and cell loading in labor-intensive manufacturing cells
Authors: Gürsel A. Süer, Cihan Dagli
Venue: Computers and Industrial Engineering (2005)

Labor-intensive manufacturing cells consist of simple machines and equipment that require continuous operator attendance and involvement. Operators are often re-assigned to different machines when a new product is released to the cell. The main reason for this re-assignment is to maximize the output rate of the cell by balancing the flow of products through several machines with varying capacities. In this paper, first a product-sequencing problem with the objective of minimizing the total intra-cell manpower transfers is introduced. A three-phase hierarchical methodology is proposed to solve the problem optimally. Next, manpower transfer matrix values are modified considering the distances traveled among machines. In the second part of the paper, a machine-level-based similarity coefficient that uses the number of machines as a similarity measure is discussed. Later, these coefficients are used during the cell loading process to minimize makespan and also machine and space requirements. Manpower allocation decisions are made along with scheduling decisions that are critical in most labor-intensive manufacturing cells and both approaches are illustrated with an example problem.
Autoregressive-model-based missing value estimation for DNA microarray time series data
Authors: Miew Keen Choong, Maurice Charbit, Hong Yan
Venue: IEEE Transactions on Information Technology in Biomedicine (2009)

Missing value estimation is important in DNA microarray data analysis. A number of algorithms have been developed to solve this problem, but they have several limitations. Most existing algorithms are not able to deal with the situation where a particular time point (column) of the data is missing entirely. In this paper, we present an autoregressive-model-based missing value estimationmethod (ARLSimpute) that takes into account the dynamic property of microarray temporal data and the local similarity structures in the data. ARLSimpute is especially effective for the situation where a particular time point contains many missing values or where the entire time point is missing. Experiment results suggest that our proposed algorithm is an accurate missing value estimator in comparison with other imputation methods on simulated as well as real microarray time series datasets.
Average-value analysis of 802.11 WLANs with persistent TCP flows
Authors: Raffaele Bruno, Marco Conti, Enrico Gregori
Venue: IEEE Communications Letters (2009)

In this letter we develop an average-value analysis of the TCP performance in 802.11 WLANs. Our model characterizes the equilibrium conditions of the network, and this method yields a simple, yet precise, estimate of the throughput obtained by persistent TCP flows. Via simulations we study the accuracy of the model predictions.
Impossible Differential-Algebraic Cryptanalysis of Serpent
Authors: Zhihua Hu, Zhongping Qin, Haiqing Han
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

Serpent is an SP Network block cipher submitted to the AES competition and chosen as one of its five finalists. The security of Serpent is widely acknowledged, especially as the best known attack so far is a differential-linear attack on only 11 rounds out of the 32 rounds of the cipher. This paper proposed impossible differential-algebraic cryptanalysis of 11-round Serpent using the key arrangement scheme of Serpent as well as the attack principle of impossible differential analysis, according to the algebraic equation of S-box. The new method analyzed block 11-round Serpent with selected plaintexts and memory space.
Spherical harmonic analysis and synthesis using FFT: Application to temporal gravity variation
Authors: Cheinway Hwang, Yu-Chi Kao
Venue: Computers Geosciences (2006)

FFT and complex algebra-based methods of spherical harmonic analysis and synthesis are presented. Two computer programs in FORTRAN are developed based on the methods. Both general and special cases are discussed. Special cases involve the analyses of gravity changes of the hydrological origin and the atmospheric origin. Functionals of the Earth's gravity field such as gravity anomaly and geoidal height can also be computed via synthesis. Thermal-corrected sea level anomaly from TOPEX/Poseidon and atmospheric pressure from ECMWF are used to compute changes of geopotential coefficients due to oceanic and atmospheric mass redistributions. Interesting phenomena in the changes of geopotential coefficients have been identified. The two computer programs can facilitate analyses and syntheses of gravity products from satellite missions such as GRACE.
A model for spatio-temporal network planning
Authors: Ed Nash, Phil James, David Parker
Venue: Computers Geosciences (2005)

Temporal GIS research has tended to focus on representing a single history through a series of states. For planning future work involving alternative scenarios a branching model of time may be required, however for large systems such models soon become highly complex. In this paper we introduce the temporal topology model which allows sections of work and the spatial, temporal and logical relationships between them to be represented efficiently together with the associated costs. We then discuss how this model could be used for analysis to determine an optimal plan, illustrated with a case study involving cycle network planning, and briefly describe some practical results which have been obtained.