ppxscal/embedding_network huggingface dataset:
Sampling urban mobility through on-line repositories of GPS tracks
Authors: Michał Piórkowski
Venue: Proceedings of the 1st ACM International Workshop on Hot Topics of Planet-Scale Mobility Measurements (2009)

We analyze urban mobility by relying on the short-term mobility traces gathered from a publicly available web-based repository of GPS tracks - the Nokia Sports Tracker service. All mobility traces are obtained from a set of kml files. We show how the data collected voluntarily by individuals, equipped with GPS-enabled mobile phones, can be used to infer accurate, large-scale footprint of urban mobility. This method, unlike others - for example, personal interviewing, is more scalable and less time consuming. It exploits the fact that the on-line masses are willing to share their experience with others. We present a set of heuristics used to filter out bogus tracks from the dataset. We show that the mobility patterns, inferred from the remaining, credible, short-term mobility traces have macroscopic characteristics similar to the characteristics of mobility patterns retrieved from the long-term mobility traces, gathered in different urban environments. The results of our analysis lead to a proposal for creating city-specific mobility profiles. We discuss how such profiles could help improve location privacy and help develop new context-aware applications and services for mobile users.
Hybrid preservation of conditionally nonblocking switches under 2-stage interconnection
Authors: Xuesong Jonathan Tan, Shuo-Yen Robert Li
Venue: IEEE Transactions on Communications (2009)

The 2-stage interconnection network is the most compact design in recursive construction of switches. Its 2X and X2 versions preserve several types of conditionally nonblocking switches and thereby enable recursive construction. This paper introduces hybrid preservation of new types of conditionally nonblocking switches. One application is in the construction of distributors.
Web personal name disambiguation based on reference entity tables mined from the web
Authors: Xianpei Han, Jun Zhao
Venue: Proceeding of the eleventh international workshop on Web information and data management (2009)

Ambiguous personal names are common on the Web, which pose a challenge for many different tasks. The traditional disambiguation employs the clustering methods. However, without reference entity tables, the clustering method can only identify whether two names refer to the same entity, rather than identify which entities they refer to. Furthermore, clustering methods are difficult to achieve robust performance on different names. Some recent disambiguation methods (the link-with-entity-base methods) extract the reference entity tables from online entity bases. The link-with-entity-base methods, however, suffer from the entity base's limited coverage problem, so it can only disambiguate names in a limited coverage. In this paper, to overcome the previous methods' deficiencies, we propose a web-querying method to mine the reference entity tables from the Web automatically with the help of professional category knowledge. Then, we disambiguate personal names by linking them to the personal entities within the mined tables through categorization. The experimental results on the dataset extracted from Freebase show that our web-querying method can effectively mine personal entity with an F-measure 0.90. The disambiguation results on WePS datasets show that our method can achieve more robust and informative performance than the traditional clustering methods; and outperforms the traditional link-with-entity-base methods with a 0.29 improvement in F-measure.
Impact of Efficient Methodologies on Programming Languages Based on Compact Algorithms
Authors: Yude Wang, Zhiming Qu
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 01 (2009)

Analyzing E-business has been used to analyze the transistor, and current trends suggest that the evaluation of Web services will soon emerge. Given the current status of compact models, cryptographers dubiously desire the improvement of the location-identity split, which embodies the natural principles of programming languages. Using the compact algorithms, it is concluded that the new knowledge-based modalities are explored, which proves to be practicable and useful.
Simulation modelling as a dynamic operational decision support tool for manufacturing systems
Authors: Lina Wang, Hossam Ismail
Venue: Proceedings of the IASTED Asian Conference on Modelling and Simulation (2007)

Simulation Modelling has long been used in the manufacturing environment to enhance design, planning and decision making process. This paper proposes an implementation framework to explore how simulation can be applied as a dynamic online decision support tool. The proposed framework is to describe both static and dynamic behavioural characteristics with automated system data collection, interpretation and optimisation. A better understanding of system performance and performance fluctuation tendency as well as understand the impact of planned events, decision makers could have more reliable information for decision making.
Application of Improved KMP Algorithm in Tire Disfigurement Recognition
Authors: Fengying Cui, Baoming Shan
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 02 (2009)

Image matching is usually used in tire disfigurement recognition. Traditional template matching methods such as the NC and the SSDA have high matching precision, but the calculating is hard and time consuming. The fast template matching algorithm based on the projection and the KMP algorithm has been proposed. Firstly, the feature string is gotten by projecting the image followed by matching it to get the approximate matching results. Secondly, the NC method is used to validate the approximate matching results. The algorithm has been used in the tire disfigurement recognition based on image matching and proven to be efficient.
A 60-W multicarrier WCDMA power amplifier using an RF predistorter
Authors: Kyung-Hoon Lim, Gunhyun Ahn, Sungchan Jung, Hyun-Chul Park, Min-Su Kim, Ju-Ho Van, Hanjin Cho, Jong-Hyuk Jeong, Cheon-Seok Park, Youngoo Yang
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

In this brief, we present a 60-W power amplifier that is linearized using an RF predistorter for multicarrier wideband code-division multiple-access (WCDMA) applications. The proposed RF predistorter is fully composed of RF or analog circuits, and it has a moderate memory effect compensation capability using a delayed third-order intermodulation (IM3) component path. It also includes the IM5 generation circuits and a compact IM3 generator that is capable of autocanceling for the fundamental component. The proposed RF predistorter was implemented and applied to a 60-W high-power WCDMA amplifier. For a four-carrier downlink WCDMA signal, the RF predistorter improved the adjacent channel leakage power ratio at a 5-MHz offset by 6.19 dB at an average output power of 48 dBm. The total efficiency of the system is as high as 13.6% at the same output power level. At an output power level of 60 W, the linearized power amplifier complies with the linearity specification of the WCDMA system.
Low Complexity Transcoder for MPEG2 to H.264
Authors: Zhang Jian, Deng Zhi-yong
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 01 (2009)

Video transcoding is the video standard of a major technology transition, specially the proposed standard H.264, Conversion on the H.264 video coding has become an important and difficult. In this paper, it detailed has an analysis in the current fast transcoder on the basis of a low complexity from MPEG2 to H.264 encoding method of the fast transcoder. The method is based on the principle of the minimum residual energy of motion estimation, as well as the modes of H.264 in the distribution of statistical properties, layered adaptive energy methods to reduce the time of inter-frame prediction modes selection when re-motion estimation. The results showed that compared to full modes search method, the method proposed in bit rate-distortion curves are basically the same, in the video image quality is basically the same as or even better, and in the transcoding it can save more than 50% of the time. With other fast transcoding algorithm, proposed method has lower complexity, higher video quality, a shorter time transcoding.
A Distance Measurement Platform Dedicated to Electrical Engineering
Authors: Noelle Lewis, Michel Billaud, Didier Geoffroy, Philippe Cazenave, Thomas Zimmer
Venue: IEEE Transactions on Learning Technologies (2009)

This paper presents the remote laboratory eLab, dedicated to electrical engineering education. eLab is a flexible measurement platform that permits to run more than 130 experiments in the fields of electronics and microelectronics. The instructor can choose or create different types of pedagogical scenarios, covering teaching requirements from undergraduate to graduate levels. Furthermore, eLab implementation and use do not require any commercial software. Its reliability has been proven during many practical classes in France and other countries. eLab is now a key component of the Bordeaux University e-Learning material in electrical engineering. In the field of analog integrated circuits design, eLab offers a unique measurement solution, which can be combined to traditional circuit simulation sessions.
Towards framework definition to obtain secure business process from legacy information systems
Authors: Alfonso Rodríguez, Angélica Caro, Eduardo Fernández-Medina
Venue: Proceeding of the first international workshop on Model driven service engineering and data quality and security (2009)

Nowadays, enterprises deal with Legacy Information Systems (LIS) that are very important to carry out their daily tasks. These systems that are mission critical and very difficult to replace, contain much information about the Business Processes (BP) that support the operation of the enterprise. In most cases, this information is not easy to obtain and on the contrary, the effort in time and money required to obtain it discourages any attempt to carry out this task. In this paper, we present the preliminary definition of a framework that, through model transformation, will allow us to obtain information about the BP from the LIS, paying special attention to security requirements. Thus, it will be possible to have Secure Business Processes (SBP) that, besides providing an additional view of the information that underlies the LIS, could be used as a starting point in a process of creation of information Systems.
A complete cellular manufacturing system design methodology based on axiomatic design principles
Authors: O. Kulak, M. B. Durmusoglu, S. Tufekci
Venue: Computers and Industrial Engineering (2005)

This paper provides a framework and a road map for people who are ready to transform their traditional production system from process orientation to cellular orientation, based on Axiomatic Design (AD) principles. A feedback mechanism for continuous improvement is also suggested for evaluating and improving the cellular design against pre-selected performance criteria. A complete implementation of the proposed methodology at a manufacturing company and resulting performance improvements are also provided.
Computation of posterior marginals on aggregated state models for soft source decoding
Authors: Simon Malinowski, Hervé Jégou, Christine Guillemot
Venue: IEEE Transactions on Communications (2009)

Optimum soft decoding of sources compressed with variable length codes and quasi-arithmetic codes, transmitted over noisy channels, can be performed on a bit/symbol trellis. However, the number of states of the trellis is a quadratic function of the sequence length leading to a decoding complexity which is not tractable for practical applications. The decoding complexity can be significantly reduced by using an aggregated state model, while still achieving close to optimum performance in terms of bit error rate and frame error rate. However, symbol a posteriori probabilities can not be directly derived on these models and the symbol error rate (SER) may not be minimized. This paper describes a two-step decoding algorithm that achieves close to optimal decoding performance in terms of SER on aggregated state models. A performance and complexity analysis of the proposed algorithm is given.
Pinning control of uncertain complex networks to a homogeneous orbit
Authors: Yingying Wu, Wei Wei, Guoyang Li, Ji Xiang
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

A sufficient condition for the stability of uncertain complex networks is derived in terms of linear matrix inequalities based on the V-stability tool, which associates the self-dynamics of nodes with passivity degrees. Then, a pinning control strategy is proposed on the developed condition to stabilize the uncertain complex networks to a homogenous orbit. As an illustrative example, a network with the Lorenz system as node self-dynamics is simulated to verify the analytic results.
A hop-constraint timing assembly algorithm for facilitating iBUS in IP-over-WDM networks
Authors: Wei Li, Anpeng Huang, Linzhen Xie, Biswanath Mukherjee
Venue: IEEE Communications Letters (2009)

The iBUS (inbuilt Burstification Urgency-driven Scheduling) algorithm delivers packets in IP-over-WDM networks in an "accurate" and "timely" manner. It employs a flexible assembly process which can interact effectively with the urgency-driven process of the iBUS algorithm. In this letter, a hop-constraint timing assembly approach is proposed, where input packets are classified by their routing hops. Then, input packets whose routing hops are more than a threshold are assembled into multi-hop bursts. Multi-hop bursts have higher priority to be scheduled by their urgency degrees, and limited-hop packets (without assembly) can be filled in voids between multi-hop bursts. This approach gives freedom to the urgency-driven process to facilitate iBUS in IP-over-WDM networks.
Hybrid Buffering Scheme for P2P Based VoD System
Authors: Linchen Yu, Hai Jin, Xiaofei Liao, Jiang Xiao
Venue: Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering (2009)

How to improve the scalability and QoS of peer-to-peer on-demand streaming system based on unstructured overlay is still a problem. Researchers have proposed some memory based buffering schemes to archive the targets. Considering the limited space of memory on one peer, a new caching strategy, which can integrate memory-caching strategy with disk-caching strategy, is proposed to make full use of peers memory, disk and bandwidth resources. Based on the new strategy, peers can request media data from neighbors of the overlay, buffer the fresh part into the memory slots and the watched part into the free local disk, which can enlarge the capacity to buffer media data. Based on the new scheme, the experimental results show that the new caching strategy improves the service capacity and QoS of the whole system greatly. The load of the media server is obviously alleviated and the continuity of playing media data is obviously improved.
Low-density parity-check codes with 2-state trellis decoding
Authors: Mao-Ching Chiu
Venue: IEEE Transactions on Communications (2009)

A class of low-density parity-check (LDPC) codes with a simple 2-state trellis structure is presented. For LDPC decoding, the conventional belief propagation (BP) algorithm consists of numerous sub-decoders of single-parity check codes and exchanges information between sub-decoders in an iterative manner. If the single-parity check codes can be constructed and grouped in a proper way, the decoder can be decomposed into few identical 2-state trellis decoders. Therefore, instead of numerous sub-decoders of single-parity check codes, an iterative decoding algorithm based on few sub-decoders over 2-state trellises is proposed. The proposed decoding algorithm improves the efficiency of message passing between sub-decoders and hence provides a fast convergent rate as compared to the standard BP algorithm. Simulation results show that the proposed scheme provides a better performance and a fast convergent rate as compared to those of standard BP algorithm. The result also shows that the proposed algorithm has a similar performance as that of asynchronous replica shuffled BP algorithm and has a slightly inferior performance than that of synchronous replica shuffled BP algorithm. However, complexity analysis shows that our proposed algorithm has complexity that is lower than that of the replica shuffled BP algorithm.
Inventory of damageable items with variable replenishment and unit production cost via simulated annealing method
Authors: Manas Kumar Maiti, Manoranjan Maiti
Venue: Computers and Industrial Engineering (2005)

Items made of glass, ceramic, etc. are normally stored in stacks and get damaged during the storage due to the accumulated stress of heaped stock. The researchers have overlooked the inventory problems for this type of items. Again the classical iterative optimization techniques very often stuck to the local optimum present in the search space. This is one of the hindrances in optimizing the non-linear problems. Annealing is the physical process of heating up a solid until it melts followed by cooling it down until it crystallizes into a state with perfect lattice. Following this physical phenomenon, recently a soft computing method, Simulated Annealing (SA), has been developed to find the global optimum for a complex cost surface through stochastic search process. In this paper, a deterministic inventory model of a damageable item is developed with variable replenishment rate and unit production cost. Here replenishment rate and unit production cost are dependent on demand. Demand and damageability are stock dependent. This dependency may be linear or non-linear. The optimum inventory level is evaluated by the profit maximization principle through SA algorithm. The model is illustrated numerically with different forms of demand and damage functions.
Gallager's exponent for MIMO channels: a reliability-rate tradeoff
Authors: Hyundong Shin, Moe Z. Win
Venue: IEEE Transactions on Communications (2009)

In this paper, we derive Gallager's random coding error exponent for multiple-input multiple-output (MIMO) Rayleigh block-fading channels, assuming no channel-state information (CSI) at the transmitter and perfect CSI at the receiver. This measure gives insight into a fundamental tradeoff between the communication reliability and information rate of MIMO channels, enabling to determine the required codeword length to achieve a prescribed error probability at a given rate below the channel capacity. We quantify the effects of the number of antennas, channel coherence time, and spatial fading correlation on the MIMO exponent. In addition, the general formulae for the ergodic capacity and the cutoff rate in the presence of spatial correlation are deduced from the exponent expressions. These formulae are applicable to arbitrary structures of transmit and receive correlation, encompassing all the previously known results as special cases of our expressions.
An outcome discovery system to determine mortality factors in primary care facilities
Authors: Jeremias Murillo, Min Song
Venue: Proceeding of the third international workshop on Data and text mining in bioinformatics (2009)

This project assembles a virtual team consisting of personnel from the New Jersey Institute of Technology with expertise in the data mining domain and the Saint Barnabas Health Care System with expertise in the medical domain. We apply proven techniques in data and text mining to the problem of hospital mortality. Methodology in outcomes research using data/text mining has typically included Bayesian Networks to include decision trees and rules, regression analysis or Neural Networks/Support Vector Machines to analyze a single disease or condition. We propose to instead analyze the entire spectrum of reasons patients are admitted to a hospital in an effort to discern what chronologies result in good outcomes and which in the worst outcome so as to identify the characteristics to be avoided throughout the spectrum of reasons for admission.
Content analysis: What are they talking about?
Authors: Jan-Willem Strijbos, Rob L. Martens, Frans J. Prins, Wim M. G. Jochems
Venue: Computers Education (2006)

Quantitative content analysis is increasingly used to surpass surface level analyses in computer-supported collaborative learning (e.g., counting messages), but critical reflection on accepted practice has generally not been reported. A review of CSCL conference proceedings revealed a general vagueness in definitions of units of analysis. In general, arguments for choosing a unit were lacking and decisions made while developing the content analysis procedures were not made explicit. In this article, it will be illustrated that the currently accepted practices concerning the 'unit of meaning' are not generally applicable to quantitative content analysis of electronic communication. Such analysis is affected by 'unit boundary overlap' and contextual constraints having to do with the technology used. The analysis of e-mail communication required a different unit of analysis and segmentation procedure. This procedure proved to be reliable, and the subsequent coding of these units for quantitative analysis yielded satisfactory reliabilities. These findings have implications and recommendations for current content analysis practice in CSCL research.
Hydra: a hybrid recommender system [cross-linked rating and content information]
Authors: Stephan Spiegel, Jérôme Kunegis, Fang Li
Venue: Proceeding of the 1st ACM international workshop on Complex networks meet information & knowledge management (2009)

This paper discusses the combination of collaborative and content-based filtering in the context of web-based recommender systems. In particular, we link the well-known MovieLens rating data with supplementary IMDB content information. The resulting network of user-item relations and associated content features is converted into a unified mathematical model, which is applicable to our underlying neighbor-based prediction algorithm. By means of various experiments, we demonstrate the influence of supplementary user as well as item features on the prediction accuracy of Hydra, our proposed hybrid recommender. In order to decrease system runtime and to reveal latent user and item relations, we factorize our hybrid model via singular value decomposition (SVD).
A computer simulation model for job shop scheduling problems minimizing makespan
Authors: R. Tavakkoli-Moghaddam, M. Daneshmand-Mehr
Venue: Computers and Industrial Engineering (2005)

One of the basic and significant problems, that a shop or a factory manager is encountered, is a suitable scheduling and sequencing of jobs on machines. One type of scheduling problem is job shop scheduling. There are different machines in a shop of which a job may require some or all these machines in some specific sequence. For solving this problem, the objective may be to minimize the makespan. After optimizing the makespan, the jobs sequencing must be carried out for each machine. The above problem can be solved by a number of different methods such as branch and bound, cutting plane, heuristic methods, etc. In recent years, researches have used genetic algorithms, simulated annealing, and machine learning methods for solving such problems. In this paper, a simulation model is presented to work out job shop scheduling problems with the objective of minimizing makespan. The model has been coded by Visual SLAM which is a special simulation language. The structure of this language is based on the network modeling. After modeling the scheduling problem, the model is verified and validated. Then the computational results are presented and compared with other results reported in the literature. Finally, the model output is analyzed.