ppxscal/embedding_network huggingface dataset:
A novel finite-element-based algorithm for fluorescence molecular tomography of heterogeneous media
Authors: Daifa Wang, Xin Liu, Yanping Chen, Jing Bai
Venue: IEEE Transactions on Information Technology in Biomedicine (2009)

The knowledge of optical properties distribution of heterogeneous media has significant impact on the reconstructed fluorescence image quality in fluorescence molecular tomography (FMT). In this study, a novel finite-element-based algorithm for FMT of heterogeneousmedia is proposed. In the algorithm, optical properties are reconstructed using the conjugate gradient method. A modified method based on reverse differential scheme is deduced for calculating the gradient when the detector points are not restricted on boundary nodes. With the recovered optical properties, linear relationship between known surface measurements of emission light and unknown fluorescence yield is then obtained. FMT reconstruction is implemented by combining algebraic reconstruction technique (ART) and Landweber iteration method. With initial value provided by ART, Landweber iteration method improves the quantification smoothly with small step length between neighboring iterations. The algorithm was evaluated using phantoms of different heterogeneity configurations. Results show that the reconstructed fluorescence yield is insensitive to various degrees of heterogeneity for the proposed algorithm. In contrast, when assuming homogeneous optical properties, it shows that more underestimation of optical properties results in more underestimation of the reconstructed fluorescence yield. Fast computation speed of the proposed algorithm is also demonstrated in this study.
Creation of school distance learning system
Authors: Marina Lapenok
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

This article runs about the co-project by Ural State Pedagogical University and Education Department of Ekaterinburg city (Russia, Ural region) on creation and introduction of distance learning system at schools. Problems of the project are described. Methodical aspects of distance courses' creation of school education and teacher training which realizes the distance form of education are considered. In the context of the project the educational information of general education courses on 8 school subjects of 10--11 grades are worked up. At the heart of educational portal lies the distance learning system and academic activities' control by NauLearning. In the article foreign experience of distance learning system for schoolboys and students is analyzed. This experience compels to add available text materials - with video data and audiolessons. The article reports about an experimental research which is directed to select and master information and communication technologies to use at online lessons.
Dynamic simulation model for non-supplementary firing triple-pressure heat recovery steam generator
Authors: Ning Cui, Bing-Shu Wang, Xiang-Yang Gong, Jian-Qiang Gao
Venue: Proceedings of the IASTED Asian Conference on Modelling and Simulation (2007)

By using the modular modeling method, a real-time dynamic simulation model for the non-supplementary tri-pressure reheat Heat Recovery Steam Generator (HRSG) is developed. On the basis of mass and energy conservation law, the paper discusses the model algorithms of the evaporator system and single-phase medium heat transfer system in HRSG according to its work mechanism and characteristics. Along with the related modular algorithm, the real-time simulation model, which the simulated object is a non-supplementary tri-pressure reheat HRSG applied in the F class combined cycle power unit in China, is built on the STAR-90 simulation system platform developed by North China Electric Power University. The simulation tests show that the dynamic simulation model can accurately simulate the transient behavior of the simulated object. It also has good static precision and generic characteristics. The model can be used for the combined cycle unit simulator development, and provides a useful tool for the control system design and analysis of the HRSG.
A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machines
Authors: Chichang Jou
Venue: Computers and Industrial Engineering (2005)

Production scheduling seeks optimal combination of short manufacturing time, stable inventory, balanced human and machine utilization rate, and short average customer waiting time. Since the problem in general has been proven as NP-hard, we focus on suboptimal scheduling solutions for parallel flow shop machines where jobs are queued in a bottleneck stage. A Genetic Algorithm with Sub-indexed Partitioning genes (GASP) is proposed to allow more flexible job assignments to machines. Our fitness function considers tardiness, earliness, and utilization rate related variable costs to reflect real requirements. A premature convergence bounce is added to traditional genetic algorithms to increase permutation diversity. Finally, a production scheduling system for an electronic plant based on GASP is implemented and illustrated through real production data. The proposed GASP has demonstrated the following advantages: (1) the solutions from GASP are better and with smaller deviations than those from heuristic rules and genetic algorithms with identical partitioning genes; (2) the added premature convergence bounce helps obtain better solutions with smaller deviations; and (3) the consideration of variable costs in the fitness function helps achieve better performance indicators.
New insights into weighted bit-flipping decoding
Authors: Xiaofu Wu, Cong Ling, Ming Jiang, Enyang Xu, Chunming Zhao, Xiaohu You
Venue: IEEE Transactions on Communications (2009)

A natural relationship between weighted bit-flipping (WBF) decoding and belief-propagation-like (BP-like) decoding is explored. This understanding can help us develop WBF algorithms from BP-like algorithms. For min-sum decoding, one can find that its WBF algorithm is the algorithm proposed by Jiang et al. For BP decoding, we propose a new WBF algorithm and show its performance advantage. The proposed WBF algorithms are parallelized to achieve rapid convergence. Two efficient simulation-based procedures are proposed for the optimization of the associated thresholds.
Performance of convolutional codes in asynchronous CDMA communications under imperfect phase-tracking conditions
Authors: Vidhyacharan Bhaskar, Laurie L. Joiner
Venue: IEEE Transactions on Communications (2009)

In this paper, the performance of short constraint length convolutional codes in imperfect phase tracking conditions is discussed. Convolutional codes are used to provide error protection to a particular user in an Asynchronous CDMA (ACDMA) system undergoing slow Rician fading. Maximum likelihood decoding with a Viterbi algorithm recovers the information symbols. A Phase Locked Loop (PLL) depicting the variations in the phase error for abrupt phase changes in the input signal is considered. Analytical bounds, which are useful in predicting the performance of the A-CDMA system are derived and plotted for the cases of infinite and finite channel memory. The upper bounds on the unconditional Bit Error Rate (BER) with Viterbi decoding are derived and plotted for the various convolutional codes considered. The simulated BERs are found to agree well with their upper bounds.
Revisiting the timing and frequency offset estimation based on cyclostationarity with new improved method
Authors: Miao Shi, Yeheskel Bar-Ness, Wei Su
Venue: IEEE Communications Letters (2009)

Timing and frequency offset estimation based on the second order cyclostationarity have been explored in many literatures [1]-[9]. In this article, we revisit the class of these estimators and propose for both single carrier and OFDM systems, a new method for timing and frequency offset estimation. Different from the previous methods, here, the estimation of timing and frequency offset process are independent of each other. Thus it does not introduce propagation error which is inherent in most of the estimators proposed so far and has an improved performance. Monte Carlo simulations are performed to verify the results.
Multiple feedback algorithm for RFID MAC protocols
Authors: You-Chang Ko, Sumit Roy, Choong-Ho Cho, Hyong-Woo Lee, Hari Krishna Garg
Venue: IEEE Communications Letters (2009)

This letter introduces a new tree-based anti-collision scheme using multiple feedbacks for uplink tag random access in a single-cell scenario. We examine MAC efficiency improvements that result from the proposed scheme in terms of uplink (UL) throughput for emerging radio frequency identification (RFID) networks, and compare it with the conventional tree based RFID MAC in ISO 18000-6 Type B standard.
Exploring Efficient Imperative Handover Mechanisms for Heterogeneous Wireless Networks
Authors: Glenford Mapp, Fatema Shaikh, Mahdi Aiash, Renata Porto Vanni, Mario Augusto, Edson Moreira
Venue: Proceedings of the 2009 International Conference on Network-Based Information Systems (2009)

The Next Generation Internet will provide ubiquitous computing by the seamless operation of heterogeneous wireless networks. It will also provide support for quality-ofservice, QoS, fostering new classes of applications and will have a built-in multi-level security environment. A key requirement of this new infrastructure will be support for efficient vertical handover. Y-Comm is a new architecture that will meet the challenge of this new environment. This paper explores the design of efficient imperative handover mechanisms using the Y-Comm Framework. It first looks at different types of handovers, then examines the Y-Comm Framework and shows how Y-Comm maps unto current mobile infrastructure. It then explores support for different handover mechanisms using Y-Comm. Finally, it highlights the development of a new testbed to further investigate the proposed mechanisms.
Designing an Arithmetic Code for Multimedia Files Compression and Encryption
Authors: Hung-Min Sun, King-Hang Wang
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 02 (2009)

Abstract—The requirements for encrypting multimedia files are very different than general purpose symmetric encryptions. With constraints including low computation power, minimum data size, and resilient to chosen ciphertext attacks, neither common block ciphers like DES/AES nor other stream ciphers are applicable to protect multimedia files. Recently, many works have been proposed to compress and encrypt these files simultaneously. However, most of them are found with severe security deficits. In this paper, we present a novel and efficient scheme to jointly compress and encrypt multimedia files base on arithmetic code. Compare to other proposed schemes, only our scheme introduces the diffusion property, which further enhances the security of the code. At the end of the paper, varies properties of the scheme are also discussed to prove that the scheme is suitable for compressing and encrypting multimedia files.
A development of a system for improving learning abilities by using a neural network and a genetic algorithm
Authors: Kazuhiro Shin-ike, Hitoshi Iima
Venue: Proceedings of the IASTED Asian Conference on Modelling and Simulation (2007)

In this paper we propose a method to determine the optimal combination to improve learning effect through approaches of system engineering. A neural network model is applied for predicting the learning results of learners. This model has input values which are potential abilities and personalities of learners and has one output value which is the correctness rate for learning problems. In order to determine the optimal combination of learners, a genetic algorithm is applied by using the prediction results. This proposed method can realize the combination of learners by a simple process.
Spatial Desynchronization: A Possible Way to Resist Calibration Attack
Authors: Arijit Sur, Piyush Goel, Jayanta Mukhopadhyay
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

In this paper$\footnote{The first author gratefully acknowledge the support received from Infosys Technologies Ltd., Bangalore, under the Infosys Fellowship Award}$ a new steganographic algorithm is proposed which can resist the calibration based blind steganalytic attack in JPEG domain steganography. The calibration attack is one of the most successful attacks to break the JPEG steganographic algorithms in recent past. One of the important features for the calibration attack is the prediction of cover image statistics from the stego image. To resist the calibration attack it is necessary to prevent the attacker from successfully predicting the cover image statistics from the stego image. The proposed algorithm is based on a concept of spatial desynchronization which can be used to separate out the embedding domain from channel domain. This domain separation helps to resist the prediction of cover statistics from stego image because the calibration of macroscopic properties become useless if embedding domain is different from channel domain. It is experimentally shown that the proposed algorithm has relatively high payload and is relatively less detectable against the calibration based blind steganalytic attacks than the existing JPEG domain steganographic schemes based on domain separation. 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
A Wavelet Watermarking Based on HVS and Watermarking Capacity Analysis
Authors: Wang-sheng Fang, Kang Chen
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

In this paper, a wavelet digital watermarking algorithm based on human visual system and watermarking capacity analysis was proposed. Firstly, watermark was scrambled through Arnold transform. Then, the frequency, texture and luminance masking factor of the improvement just noticed difference threshold model can be exploited to compute the watermark embedding intension in wavelet domain. And, with the watermarking capacity analysis, adaptive wavelet coefficients were chosen to embed the watermark. Finally, the watermark embedding intensions further adjust by watermark attack analysis. Experimental results show that this algorithm can get a watermarked image with perceptual invisibility. Moreover, the algorithm is robust to typical watermark attacks such as: noise adding, image filter, cropping and JPEG compression.
On the security of a novel and efficient unlinkable secret handshakes scheme
Authors: Renwang Su
Venue: IEEE Communications Letters (2009)

Quite recently [IEEE Commu. Letters, Vol. 13, No. 5, 2009], Huang and Cao proposed a novel and efficient unlinkable secret handshakes scheme claiming to provide unlinkability and better performance than previously reported ones. In this paper, we will point out their scheme has a serious security loophole due to an inherent design flaw. Thus, we hope that by identifying the design flaw, similar mistakes can be avoided in future unlinkable secret handshakes designs.
Routing with load balancing: increasing the guaranteed node traffics
Authors: Marija Antic, Aleksandra Smiljanic
Venue: IEEE Communications Letters (2009)

In this paper we introduce the novel routing scheme based on load balancing and shortest-path routing. First, we present the linear program for routing optimization. The nonblocking network is considered, which only limits the traffic loads of the network nodes. Guaranteed node traffic loads pass through the network regardless of the actual traffic destinations. The derived optimization includes node priority weights that allow the network planner to assign higher or lower traffic values to the network nodes. Then we analyze the performance of the proposed strategy for some realistic network topologies, and show that the proposed scheme achieves higher guaranteed node traffic loads than the regular shortest-path routing.
An Enhanced Goal-Based Semantic Web Service Discovery
Authors: Bixiang Dai, Xinke Li
Venue: Proceedings of the 2009 Second International Symposium on Knowledge Acquisition and Modeling - Volume 01 (2009)

The discovery of web services for a specific request is one of the central operations in SOA, and research on Semantic Web services (SWS) aims to achieve the automation of this step. This paper presents an enhanced goal-based approach for semantic web service discovery based on rich functional and non-functional descriptions. We distinguish goal templates and goal instances, the previous are generic and reusable objective descriptions, whereas the latter denotes concrete requests as an instantiation of a goal template stored in the system. In the basis of SDC graph we add the non-functional properties into descriptions of web service and goal instance, give a method to quantize it, and then we improve the algorithm by adding the matching of non-functional properties. Last we use WSMT which provides tool for the Semantic Web service technologies developed around the WSMO framework to demonstrate our framework.
Soft-decision list decoding of hermitian codes
Authors: Li Chen, Rolando Carrasco, Martin Johnston
Venue: IEEE Transactions on Communications (2009)

This paper proposes the first complete soft-decision list decoding algorithm for Hermitian codes based on the Koetter-Vardy's Reed-Solomon code decoding algorithm. For Hermitian codes, interpolation processes trivariate polynomials which are defined over the pole basis of a Hermitian curve. In this paper, the interpolated zero condition of a trivariate polynomial with respect to a multiplicity matrix M is redefined followed by a proof of the validity of the soft-decision scheme. This paper also introduces a new stopping criterion for the algorithm that tranforms the reliability matrix Π to the multiplicity matrix M. Geometric characterisation of the trivariate monomial decoding region is investigated, resulting in an asymptotic optimal performance bound for the soft-decision decoder. By defining the weighted degree upper bound of the interpolated polynomial, two complexity reducing modifications are introduced for the soft-decision scheme: elimination of unnecessary interpolated polynomials and pre-calculation of the coefficients that relate the pole basis monomials to the zero basis functions of a Hermitian curve. Our simulation results and analyses show that soft-decision list decoding of Hermitian code can outperform Koetter-Vardy decoding of Reed-Solomon code which is defined in a larger finite field, but with less decoding complexity.
Hardware simplification to the delta path in a MASH 111 delta-sigma modulator
Authors: Chia-Yu Yao, Chih-Chun Hsieh
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

A MASH 111 delta-sigma modulator (DSM) is widely used in a fractional-N frequency synthesizer. This brief presents a low-complexity delta-path design in a MASH 111 modulator by simply recoding all carry output signals from accumulators. Compared with the prior approach, the hardware complexity of the proposed delta path is reduced to 53.4% of the prior approach. For frequency synthesizers with limited channels or for the pipelined DSM with accumulators possessing long word lengths, this saving is significant.
Automobile, car and BMW: horizontal and hierarchical approach in social tagging systems
Authors: Tom Chao Zhou, Irwin King
Venue: Proceeding of the 2nd ACM workshop on Social web search and mining (2009)

Social tagging systems have recently emerged as an effective way for users to annotate and organize large collections of resources on the Web. Moreover, they also facilitate an efficient sharing of vast amounts of resources among different users. In this paper, we analyze tags' usage pattern in real world data sets and find that among tags representing the same concept, some tags are less popular, resulting in reduced exploring effectiveness in the current social tagging systems. Another limitation is that users cannot roll-up or drill-down the concept hierarchy of tag queries, resulting in the limited scope of service and a failure to meet users' dynamic information needs which often change with the current information provided. In order to overcome these shortcomings, we propose a novel three-phase approach as the following: (1) finding semantically-related tags for tag query; (2) constructing clusters of tags representing the same concept; and (3) building hierarchical relationships among clusters of tags. Based on our approaches, horizontal and hierarchical exploration can be implemented. Experiments employing real world dataset show encouraging results and confirm that the proposed approaches are very effective.
Segregating in- and other-cell interference with applications to decentralized admission control
Authors: Daniel Catrein, Rudolf Mathar
Venue: IEEE Transactions on Communications (2009)

This paper deals with the intertwined problems of feasibility, power allocation and call admission control on the basis of the signal-to-interference-ratio in multi-cell CDMA networks. Positively homogeneous in-cell interference functions are introduced. Under this general concept optimum power allocations are determined by first solving in-cell interference problems with fixed background noise, and subsequently a small system of linear coupling equations. This approach simultaneously clarifies the existence of some power allocation such that minimum SIR requirements are fulfilled. The decomposition is also utilized for designing a decentralized admission control algorithm. Finally, guidelines are given on how required parameters may be estimated in existing network structures.
Improving Semantic Video Retrieval via Object-Based Features
Authors: Markus Muhling, Ralph Ewerth, Bernd Freisleben
Venue: Proceedings of the 2009 IEEE International Conference on Semantic Computing (2009)

State-of-the-art systems for generic concept detection rely on low-level features, and in some cases additionally on features based on face detection, optical character recognition and/or speech recognition. In this paper, an approach for the task of semantic video retrieval is presented that systematically utilizes results of specialized object detectors. Using these object detectors trained on separate public data sets, object-based features are generated by assembling detection results to object sequences. A shot-based confidence score as well as further features, such as position, frame coverage and movement, are computed for each object class. Experimental results on TRECVID test data show significant improvements in terms of retrieval performance not only for the object classes, but also in particular for a large number of indirectly related concepts.