ppxscal/embedding_network huggingface dataset:
Exploring the Semantic Web as Background Knowledge for Ontology Matching
Authors: Marta Sabou, Mathieu D'Aquin, Enrico Motta
Venue: Journal on Data Semantics XI (2008)

In this paper we propose an ontology matching paradigm based on the idea of harvesting the Semantic Web, i.e., automatically finding and exploring multiple and heterogeneous online knowledge sources to derive mappings. We adopt an experimental approach in the context of matching two real life, large-scale ontologies to investigate the potential of this paradigm, its limitations, and its relation to other techniques. Our experiments yielded a promising baseline precision of 70% and identified a set of critical issues that need to be considered to achieve the full potential of the paradigm. Besides providing a good performance as a stand-alone matcher, our paradigm is complementary to existing techniques and therefore could be used in hybrid tools that would further advance the state of the art in the ontology matching field.
Video Server Retrieval Scheduling for Variable Bit Rate Scalable Video
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

In advanced multimedia networks, video servers with real time operating systems and high performance storage architectures will deliver multiple concurrent video streams to clients. The video server has a limited disk I/O band width. This research presents a new framework for optimally utilizing the on-board memory to alleviate the disk bandwidth bottleneck. The optimal utilization of the memory resource is achieved by using an optimal retrieval schedule for video data across the disk-memory interface. The optimal retrieval schedule is directly applicable to video servers that are based on general storage architectures (e.g. RAID). Performance evaluation using real MPEG2 trace data verifies that this approach can provide large increases in the number of supported video streams. 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
How To Be A Programmer: A Short, Comprehensive, and Personal Summary
Authors: Robert L. Read
Venue:  (2008)

This book summarizes so many things we need to know as a programmer, from a programmer 's perspective. Starting from the basic technical skills one must acquire, to managerial skills to manage a team of programmers.Emphases are put on the ethics of working as a programmer and as a member of the team. Inside this book you'll find tips on how to learn communication language among your peers, how to talk to non-engineers, and how to deal with difficult people. This book also shows us how to take a break when needed, and how to recognize when to go home, and how to communicate and negotiate with your boss, so that you won't end up working heroically for 50 to 60 hours a week. This is a very good book, one that should be a mandatory for wannabe and professional programmers. If you happened to be a manager who supervises a hive of programmers, this book should provide you with an useful insight into their beautiful minds and habits.
STON: A novel method for protein three-dimensional structure comparison
Authors: Changiz Eslahchi, Hamid Pezeshk, Mehdi Sadeghi, Amir Massoud Rahimi, Heydar Maboudi Afkham, Shahriar Arab
Venue: Computers in Biology and Medicine (2009)

Protein structure comparison is an important problem in bioinformatics and has many applications in the study of structural and functional genomics. During the last decades, various heuristic methods have been developed to solve the protein structure comparison problem. Most of the protein structure comparison methods give the alignment based on the minimum RMSD (root mean square deviation) and ignore many significant local alignments that may be important for evolutional or functional studies. We have developed a new algorithm to find aligned residues in two proteins with desired RMSD value. The parameterized distance and rotation in this program enable us to search for strongly or weakly similar aligned fragments in two proteins.
Plenary lecture I: influence of segmentation to efficiency of joint channel coding and cryptography
Authors: Natasa Zivic
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

Newly researches show that cooperation between the elements of the receiver improves the accuracy of the received information. Such cooperation is especially important in noisy environments, as wireless, mobile and satellite communications. Examples of cooperate work of elements of receiver are: 1. iterative decoding with feedback used inside of the channel decoder for Turbo codes in order to decrease the error rate 2. the feedback information about the decoded bits from the channel decoder to the demodulator used to improve the equalization and synchronization of the demodulator 3. the feedback information from the source decoder to the channel decoder used to improve the channel decoding (so-called source channel decoding). Joint Channel Coding and Cryptography represents the combination of cryptography and convolutional channel coding. SISO channel decoder and decryptor exchange output information with each other, enabling correction of the output results. This cooperation introduces feedback from decryptor to the SISO decoder for sending information which helps correction of results. The algorithm of Joint Channel Coding and Cryptography is based on the use of L-values (reliability values) which are output of the SISO channel decoder and input to the decryptor. L-values show the probability of wrong decoded bits of the received information. Therefore absolute L-values are ordered per their greatness, for correction of bits with the lowest absolute L-values which have the highest probability of being wrong decoded. Joint Channel Coding and Cryptography uses feedback for improving of decoding results using the information previously corrected by the lowest absolute L-values. Efficiency of the feedback, depending on the lengths of information which have to be corrected, is the subject of this lecture.
Volume Distortion for Subsets of Euclidean Spaces
Authors: James R. Lee
Venue: Discrete Computational Geometry (2009)

In Rao (Proceedings of the 15th Annual Symposium on Computational Geometry, pp. 300306, 1999), it is shown that every n-point Euclidean metric with polynomial aspect ratio admits a Euclidean embedding with k-dimensional distortion bounded by , a result which is tight for constant values of k. We show that this holds without any assumption on the aspect ratio and give an improved bound of . Our main result is an upper bound of independent of the value of k, nearly resolving the main open questions of Dunagan and Vempala (Randomization, Approximation, and Combinatorial Optimization, pp. 229240, 2001) and Krauthgamer et al. (Discrete Comput. Geom. 31(3):339356, 2004). The best previous bound was O(log n), and our bound is nearly tight, as even the two-dimensional volume distortion of an n-vertex path is .
Metabolic flux balance analysis of an industrially useful microorganism Corynebacerium glutamicum by a genome-scale reconstructed model
Authors: Hiroshi Shimizu, Yohei Shinfuku, Masahiro Sono, Chikara Furusawa, Takashi Hirasawa
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

Microorganisms have multi-hierarchical networks such as gene, protein and metabolites in the cells. In silico genome-scale metabolic models allow us to analyze characteristics of metabolic systems of organisms. In this study, we newly reconstructed a genome-scale metabolic model of an industrially useful microorganism, Corynebacterium glutamicum, based on genome sequence annotation and physiological data. The metabolic characteristics were analyzed using flux balance analysis (FBA). We simulated the metabolic fluxes both under aerobic and oxygen deprivation conditions. The predicted growth rates and production rates of organic acids as lactate and succinate exhibited good agreement with experimental data reported in the literatures. The genome-scale metabolic model provides a better understanding for evaluating metabolic capabilities and predicting metabolic characteristics of C. glutamicum. This can be a basis for in silico analyses of metabolic network.
The Role of Laptop as a Platform in an Outcome-Based Learning Environment
Authors: Emad Bataineh, Abdallah Tubaishat
Venue: Proceedings of the 2009 International Conference on Mobile, Hybrid, and On-line Learning (2009)

The advancement of technology along with expanding expectations of students, faculty, employers and society at large presents a growing challenge throughout higher education as institutions strive to enhance learning environment. Recently, many institutions around the world are using laptops in learning. The ZU laptop initiatives aimed to improve the quality of education by providing anytime, anywhere learning environment that helps students to be active and independent learners, using laptops as potable libraries, laboratories, and communication ports, extending their educational reach well beyond classroom walls, and providing 24 hour student access to learning resources. This paper presents a discussion and findings from a case-study conducted at the College of Information Technology of Zayed University. Results show studying in a laptop learning environment helped students be more confident in expressing their ideas, develop their communication skills, and most importantly be independent learner.
Accelerating PQMRCGSTAB algorithm on GPU
Authors: Canqun Yang, Zhen Ge, Juan Chen, Feng Wang, Qiang Wu
Venue: Proceedings of the combined workshops on UnConventional high performance computing workshop plus memory access workshop (2009)

The general computations on GPU are becoming more and more popular because of GPU's powerful computing ability. In this paper, how to use GPU to accelerate sparse linear system solver, preconditioned QMRCGSTAB (PQMRCGSTAB for short), is our concern. We implemented a GPU-accelerated PQMRCGSTAB algorithm on NVIDIA Tesla C870. Three optimization methods are used to improve the performance of the GPU-accelerated PQMRCGSTAB algorithm: reorganizing data by data packing and matrix mending to obtain higher memory bandwidth; using texture memory instead of shared memory; exploiting the kernel mergence. The experimental results show that the GPU-accelerated PQMRCGSTAB algorithm achieves the peak performance of 17.7 GFLOPS on C870. Compared with a MPI version PQMRCGSTAB algorithm executed on an Intel Xeon quad-core CPU, GPU-accelerated PQMRCGSTAB can reach the speedup of five for a 640Kx640K matrix.
Modal learning neural networks
Authors: Dominic Palmer-Brown, Sin Wee Lee, Chrisina Draganova, Miao Kang
Venue: WSEAS Transactions on Computers (2009)

This paper will explore the integration of learning modes into a single neural network structure in which layers of neurons or individual neurons adopt different modes. There are several reasons to explore modal learning. One motivation is to overcome the inherent limitations of any given mode (for example some modes memorise specific features, others average across features, and both approaches may be relevant according to the circumstances); another is inspiration from neuroscience, cognitive science and human learning, where it is impossible to build a serious model without consideration of multiple modes; and a third reason is non-stationary input data, or time-variant learning objectives, where the required mode is a function of time. Two modal learning ideas are presented: The Snap-Drift Neural Network (SDNN) which toggles its learning between two modes, is incorporated into an on-line system to provide carefully targeted guidance and feedback to students; and an adaptive function neural network (ADFUNN), in which adaptation applies simultaneously to both the weights and the individual neuron activation functions. The combination of the two modal learning methods, in the form of Snap-drift ADaptive FUnction Neural Network (SADFUNN) is then applied to optical and pen-based recognition of handwritten digits with results that demonstrate the effectiveness of the approach.
New Similarity Measure for Restricted Floating Sensor Networks
Authors: Yuan Feng, Xiaodong Liu, Xiangqian Ding
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Similarity-based search has been a hot research topic for a long history, which is widely used in many applications. The large scale Restricted Floating Sensor (RFS) network is an important mod-el in offshore data collection [1]. This paper constructs a new fuzzy similarity measures based on distance. This work provides a theoretical guidance for constructing a fuzzy query processing strategy for our RFS networks. From [2] we know our work over distance and similarity is a reasonable generalization and extension of other Fuzzy Sets.
The Design of a Large Point Reconfigured FFT Based on FPGA
Authors: Wu Qiang, Chen He
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

In this paper, we present a design and implementation of a large points reconfigured FFT. This design utilizes one chip FPGA to implement FFT/IFFT operation of high-speed data stream, which adopts two-dimension, parallel and pipeline stream mode and implements the reconfiguration of FFT’s points. It adopts trigonometric function interpolation to compress the twiddle-factors, which can reduce the resources and depress the power of FPGA. This design can be used to implement reconfigured FFT operation which can be from 1K to 1M points. It reaches the requirement of high-speed digital signal process. This design implements large points and reconfigured FFT operation and the aim is to realize miniaturization and low-power.
Chirped sampled fiber Bragg grating based multi-wavelength fiber ring laser
Authors: Qizhen Sun, Li Xia, Deming Liu, Ping Shum, Hairong Liu, Ziheng Xu
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Discrete phase shifts are introduced in each sampling section along a chirped sampled fiber Bragg grating (FBG) structure to realize a multiple-reflection-band reflector. Various channel spacing can be achieved by a single strongly chirped phase mask where the required phase shift can be controlled by a precise translation stage. An eight-wavelength semiconductor optical amplifier (SOA) based fiber ring laser is designed and experimentally demonstrated, by incorporating such multichannel FBG reflector with channel spacing of 2.0 nm acting as wavelength selection in the fiber ring cavity. This kind of laser will be useful in applications requiring multi-wavelength components
Reducing query overhead through route learning in unstructured peer-to-peer network
Authors: Selim Ciraci, İbrahim Körpeoglu, Özgür Ulusoy
Venue: Journal of Network and Computer Applications (2009)

In unstructured peer-to-peer networks, such as Gnutella, peers propagate query messages towards the resource holders by flooding them through the network. This is, however, a costly operation since it consumes node and link resources excessively and often unnecessarily. There is no reason, for example, for a peer to receive a query message if the peer has no matching resource or is not on the path to a peer holding a matching resource. In this paper, we present a solution to this problem, which we call Route Learning, aiming to reduce query traffic in unstructured peer-to-peer networks. In Route Learning, peers try to identify the most likely neighbors through which replies can be obtained to submitted queries. In this way, a query is forwarded only to a subset of the neighbors of a peer, or it is dropped if no neighbor, likely to reply, is found. The scheme also has mechanisms to cope with variations in user submitted queries, like changes in the keywords. The scheme can also evaluate the route for a query for which it is not trained. We show through simulation results that when compared to a pure flooding based querying approach, our scheme reduces bandwidth overhead significantly without sacrificing user satisfaction.
Dynamics of fine mechanical embarked systems in channel of (RHSO) launcher
Authors: Constantin Enache, Eugen Trana, Tudor Chereches
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The motion of pieces system takes place when a device is moving in the launcher to be continuing on the flying on a trajectory. General theorems of dynamics lead to the differential system of equations to move the pieces. One considers the moving of a device in channel of the launcher as a rotation with translation, so that; the centre of mass is translated in direction of OX axis. With the help of a numerical simulation the paperwork presents the particular movement with its associated velocity of a safety cylinder.
Truthful mechanisms for two-range-values variant of unrelated scheduling
Authors: Changyuan Yu
Venue: Theoretical Computer Science (2009)

In this paper, we consider a restricted variant of the scheduling problem, where the machines are the strategic players. For this multi-parameter mechanism design problem, the only known truthful mechanisms use task independent allocation algorithms and only have approximation ratio O(m) [N. Nisan, A. Ronen. Algorithmic mechanism design (extended abstract), in: STOC'99: Proceedings of the thirty-first annual ACM symposium on Theory of computing, ACM, New York, NY, USA, 1999. pp. 129-140; A. Mu'alem, M. Schapira, Setting lower bounds on truthfulness: Extended abstract, in: SODA'07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2007, pp. 1143-1152; P. Lu, C. Yu, An improved randomized truthful mechanism for scheduling unrelated machines, in: 25th International Symposium on Theoretical Aspects of Computer Science, STACS, 2008, pp. 527-538; P. Lu, C. Yu, Randomized truthful mechanisms for scheduling unrelated machines, in: C.H. Papadimitriou, S. Zhang (Eds.), Proceedings of WINE, in: Lecture Notes in Computer Science, vol. 5385, Springer, 2008, pp. 402-413]. Lavi and Swamy first use the cycle monotone condition and design a 3-approximation truthful mechanism for a two value variant in [R. Lavi, C. Swamy, Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity, in: EC'07: Proceedings of the 8th ACM conference on Electronic commerce, ACM, New York, NY, USA, 2007, pp. 252-261], where the processing time of task j on machine i, say t"i"j, can only be either a lower value L"j or a higher value H"j. We consider a generalized variant, where t"i"j lies in [L"j,L"j(1+@e)]@?[H"j,H"j(1+@e)] and @e is a parameter satisfying some condition. We consider two special cases, case A when H"j/L"j>2,@?j and case B when H"j/L"j@?2,@?j, and give randomized truthful mechanisms with approximation ratio 4(1+@e) for both cases. Based on these two cases' results, we are also able to deal with the general case of our two-range-values scheduling problem. We use a combination of two mechanisms, which is also a novel method in mechanism design for scheduling problems, and finally we give a randomized truthful mechanism with approximation ratio 7(1+@e). Although the generalization seems a little incremental, we actually use a very novel technique in the key step of proving truthfulness for case A, as well as a new mechanism scheme for case B. Besides, the results in this paper are the first truthful mechanisms with constant approximation ratios when a machine (player) can report infinitely possible values, which is quite different from the two value variant, in which only finite values are available. Furthermore, together with Lavi and Swamy's work, our results suggest that such a task-dependent approach can really do much better for the scheduling unrelated machines problem.
Integrating the clinical laboratory department
Authors: Panagiotis Kalagiakos
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The fundamental objective of the Integrating the Healthcare Enterprise (IHE) initiative is to ensure that in the care of patients all required information for medical decisions is both correct and available to healthcare professionals. The Integrating the Healthcare Enterprise approach for the Laboratory Department provides a set of Workflow Integration Profiles involving clinical laboratories, clinical wards and other teams within healthcare institutions, to fully integrate diagnostic testing on in vitro specimens in the care workflows of the institution. In addition the IHE approach provides a Content Integration Profile enabling laboratories within healthcare institutions as well as standalone laboratories to share their results reports within a broad healthcare community. This paper describes the IHE integration efforts for the Laboratory Department including the integration profiles, actors and the associated transactions.
Research on Network-Based Collaborative Commodity Development
Authors: Yantao Wang, Hua Ying, Bin Zhu
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

In this paper, a detailed method is proposed to make the transformation of a product model to a commodity model. A collaborative commodity development theory based on the three properties of physical, energy and information is proposed. An integrated model composed of four sub-models is analyzed: designing sub-model, supplying sub-model, managing sub-model, and profit sub-model. The key techniques in the system development are discussed, including the network-based parts application technology and the commercial model optimization and evaluation technology. For the former, a search engine using the functional agent technology for network-based parts searching is described. A prototype system has been implemented to validate the proposed approach.
Deriving Communication Sub-graph and Optimal Synchronizing Interval for a Distributed Virtual Environment System
Authors: John C. S. Lui, Oldfield K. Y. So, Peter T. S. Tam
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Advances in the multimedia and networking technologies allow the realization of the distributed virtual environment (DVE). DVE is a distributed system which allows many clients who are located in different locations (within a LAN or across a WAN) to concurrently explore and interact with each other in a high resolution, 3-dimensional graphical virtual environment. Some of the potential applications of DVE are: tele-conferencing, distributed games, distributed interactive simulation, collaborative group-ware environment, $\ldots$, etc. One challenging issue in designing a DVE is to guarantee that each participating client to have the same consistent view of the virtual world. To provide this consistent view, the DVE needs to perform synchronization actions periodically. In this paper, we present a methodology of deriving an optimal synchronizing interval. Our work is divided into two parts. In the first part, algorithms are presented to construct suitable communication sub-graph for the clients. In the second part, we present the outline on how to derive the optimal synchronizing interval based on the proposed communication sub-graph using the Markov chain theory and the fundamental matrix.