ppxscal/embedding_network huggingface dataset:
Using Ant Colony Optimization for SuperScheduling in Computational Grid
Authors: Li Liu, Yi Yang, Lian Li, Wanbin Shi
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

The problem of how to allocate the resources optimally and adaptively in the dynamic, scalable and distribute-controlled grid environment is introduced and discussed numerously. But recent researches can't satisfy with the needs of resource allocation in grid system thoroughly. In this paper, we use the SuperScheduling concept in grid system, which is with no explicit model. And we introduce Ant Colony Optimization applied for those models to implement resource allocation. We test the validity of Ant Colony Optimization which gets good results to satisfy with the needs of resource allocation in the dynamic, scalable grid environment with no global control.
A Software Procurement and Security Primer
Authors: David Ladd
Venue: IEEE Security and Privacy (2006)

This article explores some useful concepts that help integrate security more firmly into the software-procurement process. For those involved with software or software procurement in an organization, it helps to start by asking potential vendors some simple questions about their software-development processes, education and training, and accountability.
From the Editor in Chief: Looking Backward
Authors: Robert E. Filman
Venue: IEEE Internet Computing (2006)

Looking back at his original column, "The Arachnoid Tourist," EIC Robert Filman discusses the perils of trying to predict the future.
De-noising with Novel DWT-PNNGMM for Speaker Recognition
Authors: Zhengquan Qiu, Junxun Yin
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper, two modifications for speaker recognition are presented. The goal of de-noising is to remove the noise and to remain as much as possible the important features. Recently, signal de-noising using non-linear processing, for example, wavelet transformation have become increasingly popular. First, for threshold in the wavelet domain, a semi-soft threshold function that showed the advantages over hard and soft threshold function with respect to variance and bias of the estimated value is used. Gaussian Mixture Models (GMMs) require at least several minutes of training speech, which is not comfortable for real-world applications. On the other hand, Artificial Neural Networks (ANNs) based classifiers, show better performance for telephone speech and need less training data than the GMMbased ones. Second, PNN (Probabilistic Neural Networks) and GMM are combined to improve the performance of the system. The experiment is showed that the proposed method has more advantage for speaker recognition in noise circumstance.
Latent linkage semantic kernels for collective classification of link data
Authors: Yonghong Tian, Tiejun Huang, Wen Gao
Venue: Journal of Intelligent Information Systems (2006)

Generally, links among objects demonstrate certain patterns and contain rich semantic clues. These important clues can be used to improve classification accuracy. However, many real-world link data may exhibit more complex regularity. For example, there may be some noisy links that carry no human editorial endorsement about semantic relationships. To effectively capture such regularity, this paper proposes latent linkage semantic kernels (LLSKs) by first introducing the linkage kernels to model the local and global dependency structure of a link graph and then applying the singular value decomposition (SVD) in the kernel-induced space. For the computational efficiency on large datasets, we also develop a block-based algorithm for LLSKs. A kernel-based contextual dependency network (KCDN) model is then presented to exploit the dependencies in a network of objects for collective classification. We provide experimental results demonstrating that the KCDN model, together with LLSKs, demonstrates relatively high robustness on the datasets with the complex link regularity, and the block-based computation method can scale well with varying sizes of the problem.
Low Power Huffman Coding for High Performance Data Transmission
Authors: Chiu-Yi Chen, Yu-Ting Pai, Shanq-Jang Ruan
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

In this paper, we propose a low power Huffman coding by reducing the number of switching activity during data transmitting. The low power Huffman coding consists of the following two steps: Firstly, reduce the switching activity between each symbol by changing the locations of leaves node in Huffman tree. Secondly, reconstruct the Huffman tree by properly changing interior nodes to decrease switching activities of each codeword. The experimental results show that the proposed Huffman coding algorithm can reduce switching activity up to 7.25% on average and 18.04% for the best case compared with traditional Huffman coding approach in executable files. Besides, the average power consumption reduction ratio is 3.81% for other files. As a result, the proposed algorithm is very useful for data transmissions over large self-capacitances wire.
Brain Activation During Reading in Deep Dyslexia: An MEG Study
Authors: Matti Laine, Riitta Salmelin, Päivi Helenius, Reijo Marttila
Venue: Journal of Cognitive Neuroscience (2000)

Magnetoencephalographic (MEG) changes in cortical activity were studied in a chronic Finnish-speaking deep dyslexic patient during single-word and sentence reading. It has been hypothesized that in deep dyslexia, written word recognition and its lexical-semantic analysis are subserved by the intact right hemisphere. However, in our patient, as well as in most nonimpaired readers, lexical-semantic processing as measured by sentence-final semantic-incongruency detection was related to the left superior-temporal cortex activation. Activations around this same cortical area could be identified in single-word reading as well. Another factor relevant to deep dyslexic reading, the morphological complexity of the presented words, was also studied. The effect of morphology was observed only during the preparation for oral output. By performing repeated recordings 1 year apart, we were able to document significant variability in both the spontaneous activity and the evoked responses in the lesioned left hemisphere even though at the behavioural level, the patient's performance was stable. The observed variability emphasizes the importance of estimating consistency of brain activity both within and between measurements in brain-damaged individuals.
Learning from digital text in inquiry-based science classes: lessons learned in one program
Authors: Sadhana Puntambekar
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

In this paper, I present a synthesis of the lessons learned from a research program aimed at understanding how students learn from the multiple linked texts in hypertext environments in the context of scientific inquiry. I started with a research agenda intended to systematically understand the importance of several variables that affect learning from hypertext environments. Further, the goal of my research has not only been to understand how students learn from hypertext but also to identify how students use hypertext in the context of inquiry-based science classes. In my research program, I conducted a series a studies to explore these two issues in parallel. My studies have helped identify factors that affect student learning from digital text, moving toward a conceptual model of learning from multiple linked texts. In addition, they have also helped identify successful teacher strategies used to help students learn from hands-on investigations and digital resources.
Applying anatomical therapeutic chemical (ATC) and critical term ontologies to Australian drug safety data for association rules and adverse event signalling
Authors: Gary Saunders, Sasa Ivkovic, Ranadhir Ghosh, John Yearwood
Venue: Proceedings of the 2005 Australasian Ontology Workshop - Volume 58 (2005)

The sparse nature of voluntarily reported drug safety data benefits from a system that consolidates the massive amount of data into a manageable format for analysis. This has been done for Australian drug safety data by the Australian Adverse Drug Reaction Advisory Committee (ADRAC) for reactions using the systems organ class (SOC) ontology. There has long been a need for a similar kind of grouping to apply to drugs in this type of data. In ADRAC, drugs are currently listed by trade-name, where only some of these trade-names were assigned anatomical-therapeutic-chemical classification (ATC) codes. We assigned an ATC code for each ADRAC trade-name and show that this ontology facilitates the detection of drug class / reaction class associations at various levels of specificity. This allows different views of these associations (even very rare ones) and their significance measured for the development of more sensitive signal detection methods. We report that this ATC classification enables both the grouping of association rule approach that is useful for studying rare associations, and the development of an adverse reaction signal detection method.
Effects of part-task and whole-task instructional approaches and levels of learner expertise on learner acquisition and transfer of a complex cognitive skill
Authors: Jung Lim, Robert A. Reiser
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

In complex learning environments, providing instruction that facilitates transfer of learning is important. The study investigated the effects of two instructional approaches (whole-task vs. part-task) and levels of learner expertise (novice vs. advanced) on learner acquisition and transfer of a complex cognitive skill (e.g., preparing a grade book in excel) in an introductory educational technology course. The study also examined the effects of these variables on learners' cognitive load, instructional efficiency, time on task and their attitudes towards the instruction. The results indicated that there were statistically significant differences between the two treatment groups (whole-task > part-task) on (a) whole-task performance, (b) far-transfer performance, (c) instructional efficiency on the whole-task performance, and d) instructional efficiency on the far-transfer performance. However, no significant differences were found for (a) cognitive load, (b) time spent on the whole-task test, (c) time spent on the far-transfer test, and (d) attitudes toward instruction.
Process modeling for simulation
Authors: John Ryan, Cathal Heavey
Venue: Computers in Industry (2006)

This paper discusses shortfalls in relation to the requirements gathering phases of simulation. While many developments have taken place around supporting the model coding task of simulation, there are few tools available to assist in the requirements gathering phase. This is surprising as it has been reported by several researchers that the requirements phase can absorb twice as much resources as the coding phase. There are numerous process modeling tools available (over 100) that can and have been used to support the requirements phase of simulation. This paper provides a selective review of some of the most important in relation to simulation. A conclusion from this review is that none of the tools available adequately supports the requirements gathering phase of simulation. It is proposed that a process modeling tool be developed specifically to support simulation requirements gathering. The design objectives in the development of the tool are: (1) it should be capable of capturing a detailed description of a discrete event system; (2) it should have a low modeling burden and therefore be capable of being used by non-specialists; (3) it should present modeling information at a high semantic level so that manufacturing personnel can rationalize with it; (4) it should have good visualization capabilities; (5) it should support project teamwork. Based on these design objectives a proposed simulation process modeling tool called simulation activity diagrams (SAD) is presented.
Transparency and complexity benchmarking of audio watermarking algorithms issues
Authors: Andreas Lang, Jana Dittmann
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

A wide range of watermarking evaluation techniques especially for robustness has been described in the literature. Our paper sets the main focus on the evaluation of transparency and complexity of the embedding function of digital audio watermarking algorithms. Here, beside the evaluation of embedding parameters and the impact of audio content are investigated to determine the effects of transparency and complexity. The five selected watermarking algorithms, working in different domains, the embedding parameters and an audio test set is described and used for our so-called basic profile evaluation. The test results and the audio content dependencies are presented.
IT Finds Its Calling: Leading Corporate Productivity
Authors: Jamie P. Monat
Venue: IT Professional (2006)

To make your IT department effective, shift its focus from the means to the end: driving productivity.
COSMIC: Conceptually Specified Multi-Instance Clusters
Authors: Hans-Peter Kriegel, Alexey Pryakhin, Matthias Schubert, Arthur Zimek
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Recently, more and more applications represent data objects as sets of feature vectors or multi-instance objects. In this paper, we propose COSMIC, a method for deriving concept lattices from multi-instance data based on hierarchical density-based clustering. The found concepts correspond to groups or clusters of multi-instance objects having similar instances in common. We demonstrate that COSMIC outperforms compared methods with respect to efficiency and cluster quality and is capable to extract interesting patterns in multi-instance data sets.
Perceptual Analysis of Level-of-Detail: The JND Approach
Authors: Irene Cheng, Rui Shen, Xing-Dong Yang, Pierre Boulanger
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Multimedia content is becoming more widely used in applications resulting from the easy accessibility of high-speed networks in the public domain. An important component in multimedia content is 3D geometry, which in the past had low resolution due to acquisition, computational and network limitation, and was not able to approximate 3D surfaces realistically. Although processing speed and network capacity have been greatly increased in the last decade, the increase in demands for multimedia content surpass the increase in resources. Consequently, techniques for data simplification especially for 3D mesh data is inevitable in order to achieve shorter latency and satisfactory interactivity in applications. This paper presents a perceptual analysis to evaluate the visual quality associated with a change in level-of-detail. Our analysis is consistent to how the human visual system evaluates 3D objects in the real world and is based on the Just-Noticeable-Difference methodology. Experimental results show that our approach presents an accurate estimation of visual quality and thus provides a systematic method to evaluate the performance of different simplification algorithms.
Research on E-Government Knowledge Navigation System Based on XTM
Authors: Jiangnan Qiu, Yongxiang Yao, Yanzhang Wang, Xuehua Wang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Against problem on current Government Portal navigation system is mostly based on keyword. An XTM-based E-Government knowledge navigation system model was proposed, and a XTM based association and occurrences measurement mechanism is imported to the system. Especially based on analyses of topic relative semantic structure, a tree-structure semantic architecture is extracted from XTM by dividing the type of topic association. Semantics relatedness is introduced in the article to expand the second level association and calculate the degree of topic relative. The results show that the system has a good effectiveness and efficiency of navigation.
Fast Variational Segmentation using Partial Extremal Initialization
Authors: Jan Erik Solem, Niels Chr. Overgaard, Markus Persson, Anders Heyden
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

In this paper we consider region-based variational segmentation of two- and three-dimensional images by the minimization of functionals whose fidelity term is the quotient of two integrals. Users often refrain from quotient functionals, even when they seem to be the most natural choice, probably because the corresponding gradient descent PDEs are nonlocal and hence require the computation of global properties. Here it is shown how this problem may be overcome by employing the structure of the Euler-Lagrange equation of the fidelity term to construct a good initialization for the gradient descent PDE, which will then converge rapidly to the desired (local) minimum. The initializer is found by making a one-dimensional search among the level sets of a function related to the fidelity term, picking the level set which minimizes the segmentation functional. This partial extremal initialization is tested on a medical segmentation problem with velocity- and intensity data from MR images. In this particular application, the partial extremal initialization speeds up the segmentation by two orders of magnitude compared to straight forward gradient descent.
Static and Dynamic Scoring by Web Page Grouping
Authors: Hitoshi NAKAKUBO, Takashi SATO
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Web Search System exists to retrieve necessary information on the WWW space. However, these are not accuracy enough. Then, we propose the technique for using Web Page Grouping together with the link structure analysis, and aim at the improvement in accuracy. Our proposal is composed of four techniques. The first technique is Web Page Grouping to enhance it related to adjacent the link structure. The second technique is static scoring by link structure analysis using Web Page Grouping. The third technique is dynamic scoring which tempers the link structure analysis of the retrieval result set with Web Page Grouping. And, the fourth technique is a ranking technique for annexing a static score and a dynamic score. This paper describes these techniques, and reports on the experiment results.
A Design of Pipelined Carry-dependent Sum Adder With its Self-checking Structure
Authors: Ming Li, Shiyi Xu, Jialin Cao, Feng Ran, Shiwei Ma
Venue: Proceedings of the 15th Asian Test Symposium (2006)

In this paper a pipelined carry-dependent sum adder with the self-checking structure is proposed. The adder includes four 8-bit carry-dependent sum adder (CDSA) , a 4-bit block carry look-ahead unit (BCLU) and a parity checker. The necessary area of the proposed adder is only about 3.85% over the traditional ripple carry adders, while the sum of the traditional adders is delayed by 39.2% with respect to the proposed adder for 32-bit implementation.
Polynomial equations with one catalytic variable, algebraic series and map enumeration
Authors: Mireille Bousquet-Mélou, Arnaud Jehanne
Venue: Journal of Combinatorial Theory Series B (2006)

Let F(t, u) = F(u) be a formal power series in t with polynomial coefficients in u. Let F1,...,Fk be k formal power series in t, independent of u. Assume all these series are characterized by a polynomial equation P(F(u), F1,...,Fk,t,u) = 0. We prove that, under a mild hypothesis on the form of this equation, these k + 1 series are algebraic, and we give a strategy to compute a polynomial equation for each of them. This strategy generalizes the so-called kernel method and quadratic method, which apply, respectively, to equations that are linear and quadratic in F(u). Applications include the solution of numerous map enumeration problems, among which the hard-particle model on general planar maps.
Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks
Authors: Gurashish Brar, Douglas M. Blough, Paolo Santi
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

Wireless mesh networks are expected to be widely used to provide Internet access in the near future. In order to fulfill the expectations, these networks should provide high throughput simultaneously to many users. Recent research has indicated that, due to its conservative CSMA/CA channel access scheme and RTS/CTS mechanism, 802.11 is not suitable to achieve this goal.In this paper, we investigate throughput improvements achievable by replacing CSMA/CA with an STDMA scheme where transmissions are scheduled according to the physical interference model. To this end, we present a computationally efficient heuristic for computing a feasible schedule under the physical interference model and we prove, under uniform random node distribution, an approximation factor for the length of this schedule relative to the shortest schedule possible with physical interference. This represents the first known polynomial-time algorithm for this problem with a proven approximation factor.We also evaluate the throughput and execution time of this algorithm on representative wireless mesh network scenarios through packet-level simulations. The results show that throughput with STDMA and physical-interference-based scheduling can be up to three times higher than 802.11 for the parameter values simulated. The results also show that our scheduling algorithm can schedule networks with 2000 nodes in about 2.5 minutes.
Automatic Segmentation of Neck CT Images
Authors: Chia-Chi Teng, Linda G. Shapiro, Ira Kalet
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

In this era of cross-sectional imaging, it is useful to think of the neck in terms of adjacent anatomical spaces separated by fascial layers extended from the skull base to the thoracic inlet. Although these layers are not usually visible in CT or MR images, their locations can be inferred by knowing their relationships to various anatomical structures that are visible in cross-sectional images. Identifying these anatomical structures in the neck region can facilitate applications such as automated diagnosis by finding abnormality, or computer assisted radiation therapy planning by inferring cervical lymph node regions from these anatomical structures. We are proposing a system that can automatically segment the neck region from CT images by identifying the cranial and caudal bounding slices and then locating and labeling various anatomical structures in the region.
Access Control Model for P2P File-Sharing Systems Based on Trust and Recommendation
Authors: Guang-xue Yue, Fei Yu, Yi-jun Chen, Rong-hui Wu, Ji-yao An, Ren-fa Li
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

The decentralized and anonymous characteristics of P2P environments make the task of controlling access to sharing information more difficult, which cannot be done by traditional access control methods. In this paper, the access control requirements in such environments were identified, and an access control model for P2P file-sharing systems based on trust and recommendation was proposed. The model integrates aspects of trust and recommendation, fairness based participation schemes and access control schemes.