ppxscal/embedding_network huggingface dataset:
Research of Agent-Based Networked Management of Civil Engineering Laboratory
Authors: Lihua An, Hengqin Xu
Venue: Proceedings of the 2009 Second International Symposium on Knowledge Acquisition and Modeling - Volume 01 (2009)

The realization of the laboratory network management is of great significance. First, it will standardize laboratory management and improve working efficiency. Second, it adapts to the needs of laboratory modernization construction of our University. Third, it adapts to the needs for reform of experimental teaching. Fourth, it will fully play its integrated roles in laboratory management. Therefore, whether for the teaching reform or laboratory construction, this study is very significant. According to the comprehensive study about Agent technology and Civil Engineering Laboratory, we design Agents within the system, and discuss in detail one by one. The system combines laboratory teaching management with engineering quality testing, and establish flexible and open integration framework to accommodate current experimental teaching management and relatively mature detection technology, which fully guarantees smooth and effective daily teaching, effectively controls accuracy and authenticity of testing data and really achieve real-time supervision on quality testing.
Simple algorithms for updating multi-resource allocations in an unreliable flow network
Authors: Chung-Chi Hsieh, Ming-Hsien Lin
Venue: Computers and Industrial Engineering (2006)

In this paper, algorithms are developed to update the reliability-maximizing resource allocation in an unreliable flow network when either resource demand or the characteristic of the flow network changes. An unreliable flow network consists of nodes, characterized as source nodes, which supply resources of various types, sink nodes, at which resource demand takes place, and intermediate nodes, as well as unreliable directed arcs, which join pairs of nodes and whose capacities have multiple operational states. The network reliability of such an unreliable flow network is the probability that resources can be transmitted successfully from source nodes to sink nodes. With earlier developments on evaluating network reliability and resolving reliability-maximizing resource allocation problems in an unreliable flow network, one may recompute a new resource allocation strategy, when either resource demand or the characteristic of the flow network changes, without incorporating the efforts that have been made in obtaining the existing resource allocation. This study, in contrast, proposes updating, rather than recomputing, alternatives that take advantage of existing minimal path vectors and corresponding flow patterns. Procedural comparisons and numerical examples indicate that the updating schemes would perform better than the recomputing scheme in a large sized flow network that transmits various resource types.
Educational optical network simulation tool for a broadband networks course
Authors: Ardian Greca, Goran Lesaja
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

In recent years we have seen explosive development of networks due to the tremendous growth of users, traffic and bandwidth requirements. New technologies and improvements have been introduced at the fast rate to keep up with the ever growing demand on speed, reliability and security. One of the advanced technologies being successfully introduced is optical networks. This technology is rapidly expanding and is becoming available to businesses and private homes. The development and impact of optical networks has reached the stage which requires introduction of broadband communication courses into the Computer Sciences curricula. The goal of this paper is to introduce the optical network simulation tool that would aid teaching and learning of optical networking technology. The software is interactively built and it incorporates all main components needed for a successful communication in networks. The tool can be used in both undergraduate and graduate courses; however, so far it has been introduced only to master level graduate students. Students' feedback has been positive and we feel that it has contributed to the increased success in the class.
Investigating cooperation and collaboration in near synchronous computer mediated conferences
Authors: Richard Holliman, Eileen Scanlon
Venue: Computers Education (2006)

The development and use of computer mediated communications as a tool for teaching and learning has grown considerably in recent years. It has been developed to extend the conventional face-to-face tutorial environment and for distance-learning purposes, actively engaging students in productive learning situations. Here we document the findings of an analysis of near synchronous conferencing where postgraduate distance learners worked in small groups to produce a report that examined media coverage of controversial science. The results suggest that students actively engaged in both cooperative and collaborative learning in preparing and producing these reports, and that tutor interventions were an important factor in influencing peer interaction. Furthermore, we have found evidence of cooperation between learners who passively participate in vicarious learning. We consider the implications of these findings with respect to current definitions of cooperation and collaboration.
Blended-learning: enhancing performance in sales negotiations
Authors: Thorsten Bosch, Alexander Wacker, Heinz Mandl
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

For many years, the Dr. Thorsten Bosch AG has supported a large number of customers in the area of human resource development. The focus has been on the development of "soft skills" and also on conversation techniques in sales and marketing, on personnel management and on negotiation techniques. The company's experience led to considerations about how training concepts could be structured more efficiently. The result was the so-called "Bosch-model", which has been successfully used since the beginning of 2003 for training employees on how to conduct sales and marketing negotiations. By the end of the year, about 4000 participants will have gone through the training process. The structuring element is a phase model which breaks the sales negotiation down into individual phases. Participants in the training repeatedly encounter these phases in the five sequential learning steps. The end result is that the participants are able to conduct an efficient and structured sales negotiation which ideally leads to a closing a deal but that, most importantly, leads to a satisfied customer.
Proceeding of the ACM twelfth international workshop on Data warehousing and OLAP
Venue: Conference on Information and Knowledge Management (2009)

It is our great pleasure to welcome you to the 12th ACM International Workshop on Data Warehousing and OLAP -- DOLAP'09. This year's workshop continues its tradition of being the premier forum where both researchers and practitioners in the areas of data warehousing and on-line analytical processing can share their findings in theoretical foundations, current methodologies, and practical experiences. The mission of the DOLAP workshop is to identify and explore new directions for future research and development, as well as emerging application domains in the areas of data warehousing and OLAP. In recent years, research in these areas have addressed many topics, ranging from conceptual-level and methodological issues, which help designers to build effective decision-support applications, to physical-level issues, aiming at increasing the performance of these applications in order to deal with vast amounts of data. However, the successful use of data warehousing and OLAP technologies within organizations brings up new requirements and research opportunities, in particular to cope with non-traditional application domains, such as biological, multimedia, and spatio-temporal applications. The DOLAP workshop gives researchers and practitioners a unique opportunity to share their perspectives with others interested in the various aspects of the data warehousing and OLAP domains. The call for papers attracted 26 submissions, from 15 different countries and 3 continents, and 2 additional papers forwarded from CIKM. The program committee accepted 13 papers that cover a variety of topics, including multidimensional design, ETL process, and multidimensional queries. The papers in the area of multidimensional design address the discovery of functional dependencies, the partitioning of relational data warehouses, and data warehouse testing. This year there are many papers on the ETL process, which shows that this topic is getting increasing interest from the research community. These papers address a taxonomy for ETL activities, the automatic generation of ETL processes from conceptual models, the use of BPMN and BPEL for designing ETL processes, programming frameworks, cardinality estimation, and the generation of data quality rules and integration. Finally, the papers on multidimensional querying address query evaluation in distributed data warehouses, query recommendations, query languages based on XML, and answering of top-k queries via materialized views. We hope that these proceedings will serve as a valuable reference for warehousing and OLAP researchers and developers.
A genetic algorithm based approach to the mixed-model assembly line balancing problem of type II
Authors: Ana Sofia Simaria, Pedro M. Vilarinho
Venue: Computers and Industrial Engineering (2004)

Mixed-model assembly lines allow for the simultaneous assembly of a set of similar models of a product, which may be launched in the assembly line in any order and mix. As current markets are characterized by a growing trend for higher product variability, mixed-model assembly lines are preferred over the traditional single-model assembly lines. This paper presents a mathematical programming model and an iterative genetic algorithm-based procedure for the mixed-model assembly line balancing problem (MALBP) with parallel workstations, in which the goal is to maximise the production rate of the line for a pre-determined number of operators. The addressed problem accounts for some relevant issues that reflect the operating conditions of real-world assembly lines, like zoning constraints and workload balancing and also allows the decision maker to control the generation of parallel workstations.
LDPC codes based on serially concatenated multiple parity-check codes
Authors: Marco Baldi, Giovanni Cancellieri, Andrea Carassai, Franco Chiaraluce
Venue: IEEE Communications Letters (2009)

This letter proposes a new class of serially concatenated codes that can be viewed as Low-Density Parity-Check (LDPC) codes. They are derived from Multiple Serially Concatenated Single Parity-Check (M-SC-SPC) codes, but they use different components, that we call Multiple Parity-Check (MPC) codes. In comparison with M-SC-SPC codes, the new scheme achieves better performance with similar complexity. The proposed codes can represent an alternative to the well-known family of Repeat Accumulate (RA) codes, being based on the same principles.
A web-based comparative visualization system for human endogenous RetroVirus(HERV) on whole genomes
Authors: Woo-Keun Chung, Hyong-Jun Kim, Hwan-Gue Cho
Venue: Proceeding of the third international workshop on Data and text mining in bioinformatics (2009)

Human Endogenous RetroViruses(HERVs) are suggested that they have a function of regulating the activity of human genes and could produce protein in some conditions. So it is crucial to examine the physical layout relationship between HERVs and genes in the whole genome scale. In this paper we present RetroScope, a new Web-based comparative visualization system for HERV over 4 whole primate genomes including Human, Chimpanzee, Orangutan and Rhesus monkey. So RetroScope enables us to find the retro element which is very close to a specified gene in the form of exonoverlapping or promotor, primer overlapping. Thus our system enables biologist to provide global understanding by comparing the linear configuration of several HERVs in the whole chromosome scales by using a fast HERV alignment algorithm. Also by alignment of HERVs, we can find the most similar pair of chromosomes with respect to the configuration of HERV elements, which would be another clues to construct phylogenetics based on HERV. RetroScope is available on http://neobio.cs.pusan.ac.kr/sretroscope/.
Color Correction for Object Identification from Images with Different Color Illumination
Authors: Yoo-Joo Choi, Yu-Bu Lee, We-Duke Cho
Venue: Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDC (2009)

This paper presents a novel color correction method for automatic detection of identical objects from images captured in different environments. The proposed method extracts illumination color features using the color board image captured in each illumination and defines conversion vectors from a source illumination to a target illumination in the pre-processing step. In the color correction step, we apply the conversion vectors to RGB elements of each pixel in the object image. In the experiments, we captured two images including a color palette and three target objects in different illumination conditions. We define one image as a source and the other as a target. Illumination conversion vectors for the color correction are defined based on the difference between two color palette images and applied to the source image. In order to evaluate the performance of the proposed color correction, we compared the color differences of identical objects in target, source and corrected images.
Ant Colony-Based Energy-Aware Multipath Routing Algorithm for Wireless Sensor Networks
Authors: Songzhu Xia, Su Wu
Venue: Proceedings of the 2009 Second International Symposium on Knowledge Acquisition and Modeling - Volume 03 (2009)

Stringent energy constraint is one of the most critical issues in wireless sensor networks. To address this issue, this paper proposes an ant colony-based energy-aware multipath routing algorithm. The algorithm, which considers the available power of nodes and the energy consumption of each path as the reliance of routing selection, utilizes the self-organization, self-adaptability and dynamic optimization capability of ant colony system to find the optimal path and multiple candidate paths from source nodes to sink nodes. It can avoid using up the energy of nodes on the optimal path and prolong the network lifetime while preserving network connectivity. Extensive simulations validate that the algorithm has a better performance in energy consumption and load-balancing with respect to traditional routing methods.
Practical determination of impulse sample power boosting factor in impulse postfix OFDM systems
Authors: Byung Moo Lee, Youngok Kim
Venue: IEEE Communications Letters (2009)

An impulse postfix OFDM (IP-OFDM) system, which performs channel estimation in time-domain by exploiting the IP instead of pilot tones, has recently been proposed by Chang et al. Although the proposed system can achieve the enhanced bit error rate (BER) performance compared to that of conventional OFDM systems, there is an important peak-to-average power ratio (PAPR) issue of using the IP that needs to be resolved. In this letter, we propose decision criteria for determining the power boosting factor (PBF) of IP in practical IP-OFDM systems with a high power amplifier (HPA). The analysis is performed with two criteria, the complementary cumulative distribution function of signal PAPR and the input back-off to determine the PBF of IP. The best PBF can be the one which gives an equal power to the IP and the rest of the OFDM symbol. From the analytic results, however, the PBF maximizing the power of the IP out of the HPA turns out to be the best one due to the non-linearities of the HPA. Simulation results demonstrate the effectiveness of the proposed decision criteria for IP-OFDM systems.
LBCS: A Load Balanced Clustering Scheme in Wireless Sensor Networks
Authors: Shujuan Jin, Keqiu Li
Venue: Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering (2009)

In a wireless sensor network, the randomly and widely deployed sensors are powered by battery, which is impossible to get recharged after deployment. Thus, energy efficiency of the sensor nodes is an important issue in wireless sensor networks for guaranteeing the network’s lifetime. Clustering is one of the most popular and effective topologies in wireless sensor networks as it reduces the whole network’s energy consumption. In this paper, we propose a load balanced clustering scheme, which distributes the cluster head nodes’ heavy burden to other assistant nodes, and takes multi-hop scheme to transmit the aggregated data to the base station. Furthermore, in the cluster formation phase, we select the cluster node by combining the distance factor and the residual energy factor. As a result, this clustering scheme balances the whole network’s energy consumption, and prolongs the network’s lifetime. At last, we conduct some simulations in NS-2, and the results show that the proposed scheme prolongs the network lifetime longer than LEACH and EECS do.
Mining cancer genes with running-sum statistics
Authors: Inho Park, Kwang H. Lee, Doheon Lee
Venue: Proceeding of the third international workshop on Data and text mining in bioinformatics (2009)

In this paper, we propose a new method to detect candidate cancer genes for developing molecular biomarkers or therapeutic targets from cancer microarray datasets. To resolve problems resulted in the molecular heterogeneity of cancers on gene prioritizing, our proposed method is intended to identify genes that are over- or down- expressed not in the whole cancer samples but also in a subgroup of cancer samples. To this end, we propose the RS score for gene ranking calculated with a weighted running sum statistic on the ordered list of expression values of each gene. We apply the proposed method to publically available prostate cancer microarray datasets, showing that it can identify previously well known prostate cancer associated genes such as ERG, HPN, and AMACR at the top of the list of candidate genes. Embedding samples, represented as vectors of the expression values of the top 20 genes, into a two dimensional space using the commute time embedding shows the distinction between normal samples and cancer samples in the independent test datasets as well as in the training datasets. We further evaluate the proposed method by estimating classification performance on the independent test datasets, and it shows the better classification performance compared to the other cancer outlier profile approaches.
Optimal Solution for Grid Resource Allocation Using Particle Swarm Optimization
Authors: Zhi-jie Li, Xiang-dong Liu, Xiao-dong Duan, Cun-rui Wang
Venue: Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering (2009)

Resource allocation in grid environment is a complex undertaking due to the heterogeneity and dynamic nature aroused by wide area sharing. To address the heterogeneous and computationally intractable problem of resource allocation optimization in grid, this paper presents an allocation algorithm for parallel tasks based on particle swarm optimization. The heterogeneity of grid user is tackled by introducing a universal utility function. And that computational intractability is solved using iterative searching of particle swarm. Experimental results show that the proposed algorithm is convergent and performs better than genetic algorithm.
Commentary-based video categorization and concept discovery
Authors: Janice Kwan-Wai Leung, Chun Hung Li, Ting Keung Ip
Venue: Proceeding of the 2nd ACM workshop on Social web search and mining (2009)

Social network contents are not limited to text but also multimedia. Dailymotion, YouTube, and MySpace are examples of successful sites which allow users to share videos among themselves. Due to the huge amount of videos, grouping videos with similar contents together can help users to search videos more efficiently. Unlike the traditional approach to group videos into some predefined categories, we propose a novel comment-based matrix factorization technique to categorize videos and generate concept words to facilitate searching and indexing. Since the categorization is learnt from users feedback, it can accurately represent the user sentiment on the videos. Experiments conducted by using empirical data collected from YouTube shows the effectiveness of our proposed methodologies.
Optimal rate-reliability-delay tradeoff in networks with composite links
Authors: Ying Li, Mung Chiang, A. Robert Calderbank, Suhas N. Diggavi
Venue: IEEE Transactions on Communications (2009)

Networks need to accommodate diverse applications with different Quality-of-Service (QoS) requirements. New ideas at the physical layer are being developed for this purpose, such as diversity embedded coding, which is a technique that combines high rates with high reliability. We address the problem of how to fully utilize different rate-reliability characteristics at the physical layer to support different types of traffic over a network and to jointly maximize their utilities. We set up a new framework based on utility maximization for networks with composite links, meaning that each link consists of sub-links that can attain different rate-reliability characteristics simultaneously. We incorporate delay, in addition to rate and reliability, into the utility functions. To accommodate different types of traffic, we propose distributed algorithms converging to the optimal rate-reliability-delay tradeoff based on capacity division and priority queueing. Numerical results show that compared with traditional codes, the new codes can provide higher network utilities for all traffic types simultaneously. The results also show that priority queueing achieves higher network utility than capacity division.
Gallager's decoding algorithm A over high order modulations
Authors: Hyun-Koo Yang, Myung-Kyu Lee, Kyeongcheol Yang
Venue: IEEE Communications Letters (2009)

Gallager's decoding algorithm A (GDA) for low-density parity-check (LDPC) codes is of interest mainly due to its good performance with extremely low complexity. In this paper, we analyze GDA over 2m-ary pulse-amplitude modulation (2m-PAM). Firstly, we represent its average error probability by means of a recursion formula. We then define its threshold for additive white Gaussian noise (AWGN) channels and derive its stability condition. The bit-to-symbol mapping strategies have a strong influence on the performance of LDPC-coded modulation systems. Finally, we show that the bit-reliability mapping strategy proposed by Li and Ryan maximizes the threshold of the LDPC-coded modulation system with GDA over Gray-mapped 2m-PAM in the AWGN channel.
D-S Evidence Theory Based Digital Image Trustworthiness Evaluation Model
Authors: Donghui Hu, Lina Wang, Yu Zhou, Yang Zhou, Xiaqiu Jiang, Longfei Ma
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

Digital images are facing trustworthy crisis with the emergence of various digital image process tools and steganography tools. Current digital image forensic methods can not evaluate the digital image's trustworthiness. Base on Dempster-Shafer (D-S) evidence theory, this paper proposed a new model which can effectively evaluate digital image trustworthiness. Instead of using Dempster's original rule of combination, we use feature fusion method to resolve the problem of evidence conflict. Experimental results show that the new proposed model not only can evaluate digital image trustworthiness effectively, but also resolve some problems which puzzling current digital image forensic technology.