ppxscal/embedding_network huggingface dataset:
Personalization as a service: the architecture and a case study
Authors: Hang Guo, Jidong Chen, Wentao Wu, Wei Wang
Venue: Proceeding of the first international workshop on Cloud data management (2009)

Cloud computing has become a hot topic in the IT industry. Great efforts have been made to establish cloud computing platforms for enterprise users, mostly small businesses. However, there are few researches about the impact of cloud computing over individual users. In this paper we focus on how to provide personalized services for individual users in the cloud environment. We argue that a personalized cloud service shall compose of two parts. The client side program records user activities on personal de-vices such as PC. Besides that, the user model is also computed on the client side to avoid server overhead. The cloud side program fetches the user model periodically and adjusts its results accordingly. We build a personalized cloud data search engine prototype to prove our idea.
Large girth quasi-cyclic LDPC codes based on the Chinese remainder theorem
Authors: Xueqin Jiang, Moon Ho Lee
Venue: IEEE Communications Letters (2009)

In this letter, we consider two problems associated with quasi-cyclic low-density parity-check (QC-LDPC) codes. The first is how to extend the code length of a QC-LDPC code without reducing the girth. The second is how to design a QC-LDPC code with a prescribed girth easily. We deal with these two problems by using a combining method of QC-LDPC codes via the Chinese Remainder Theorem (CRT). Codes constructed with our proposed method have flexible code lengths, flexible code rates and large girth. Simulation results show that they perform very well with the iterative decoding.
Shipment partitioning and routing to minimize makespan in a transportation network
Authors: Anand S. Kunnathur, Udayan Nandkeolyar, Daowei Li
Venue: Computers and Industrial Engineering (2005)

This paper addresses the problem of partitioning and transporting a shipment of known size through an n-node public transportation network with known scheduled departure and arrival times and expected available capacities for each departure. The objective is to minimize the makespan of shipping. The problem while practical in its scope, has received very little attention in the literature perhaps because of the concentration of research in vehicle routing without regard to partitioning and partitioning without regard to routing. A general non-linear programming model is developed. The model is then converted into a linear model through the Routing First and Assignment Second approach. This approach is different from the general decomposition approaches since they normally do not guarantee optimality. However, the linear model still involves a large number of constraints, and solution is not attempted here. Instead, three heuristics are proposed for solving the problem. Two of the heuristics use iterative techniques to evaluate all possible paths. The third heuristic uses a max-flows approach based upon aggregated capacities to reduce the size of the network presented to the other heuristics. This allows for a good starting point for other heuristics, and may impact the total computational effort. We find that the heuristics developed perform well because in the case of networks that are not congested, they find the optimal solution.
Role of weak ties in link prediction of complex networks
Authors: Linyuan Lü, Tao Zhou
Venue: Proceeding of the 1st ACM international workshop on Complex networks meet information & knowledge management (2009)

Plenty of algorithms for link prediction have been proposed and were applied to various real networks. Among these works, the weights of links are rarely taken into account. In this paper, we use local similarity indices to estimate the likelihood of the existence of links in weighted networks, including Common Neighbor, Adamic-Adar Index, Resource Allocation Index, and their weighted versions. In both the unweighted and weighted cases, the resource allocation index performs the best. To our surprise, the weighted indices perform worse, which reminds us of the well-known Weak Tie Theory. Further experimental study shows that the weak ties play a significant role in the link prediction problem, and to emphasize the contribution of weak ties can remarkably enhance the predicting accuracy.
Web Exploitation for Definition Extraction
Authors: Gerardo Sierra, Rodrigo Alarcon, Alejandro Molina, Edwin Aldana
Venue: Proceedings of the 2009 Latin American Web Congress (la-web 2009) (2009)

We present a system to extract definitions from a term using the Web. Definitions are organized according to a typology and its context. The structural and functional design is described; emphasizing its relevant components: the extractor of definitional context to candidates using the Yahoo!’s BOSS API; the extractor of definitional contexts and a clustering module based on textual energy as a measure of similarity.
On privacy preservation in text and document-based active learning for named entity recognition
Authors: Fredrik Olsson
Venue: Proceeding of the ACM first international workshop on Privacy and anonymity for very large databases (2009)

The preservation of the privacy of persons mentioned in text requires the ability to automatically recognize and identify names. Named entity recognition is a mature field and most current approaches are based on supervised machine learning techniques. Such learning requires the presence of labeled examples on which to train; training examples are usually provided to the learner on the form of annotated corpora. Creating and annotating corpora is a tedious, meticulous and error prone process; obtaining good training examples is a hard task in itself. This paper describes the development and in-depth empirical investigation of a method, called BootMark, for bootstrapping the marking up of named entities in textual documents. Experimental results show that BootMark requires a human annotator to manually annotate fewer documents in order to produce a named entity recognizer with a given performance, than would be needed if the documents forming the basis for the recognizer were randomly drawn from the same corpus. The investigation further indicates that the primary gain obtained by BootMark compared to passive learning is in terms of higher recall. Thus, it is argued, the recognizers are suitable for use in privacy preservation applications.
Application of Case-Oriented Evidence Mining in Forensic Computing
Authors: Jun Zhang, Lina Wang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

In this paper, we proposed a new digital forensic process model, named COEM (case-oriented evidence mining model), along with its approaches, top-down. The model consists of sets of tasks described at two levels of abstraction: case (from requirement to finding) and data (from general to specific). The COEM facilitates analysis in a viewpoint of case instead of data, and gives investigators a more natural and rational perspective. As an example, we illustrate its application with a digital crime case accused of distributing pornographic materials through WAP sites in China.
A new ML based interference cancellation technique for layered space-time codes
Authors: Sungkyu Jung, Jungwoo Lee
Venue: IEEE Transactions on Communications (2009)

This paper presents a new and simple decoding algorithm for layered space time block codes such as the two independent Alamouti's codes which are also called the double space-time transmit diversity (DSTTD) system. By using group interference suppression and successive interference cancellation, we can treat DSTTD as two independent space-time block codes (STBC). We can then decode both of these STBC's through a simple maximum likelihood (ML) detector with null space-based interference cancellation. We also compare the proposed interference cancellation (IC) scheme with the conventional MMSE IC scheme. The performance of the proposed IC scheme is comparable to that of the MMSE IC scheme while the complexity reduction factor of the proposed scheme can be up to 5 compared to the MMSE IC scheme.
Lower bounds on the redundancy of link-recovery mechanisms
Authors: Dominic A. Schupke
Venue: IEEE Transactions on Communications (2009)

The paper derives lower bounds on the redundancy, the protection capacity to working capacity ratio, needed by link-protection or link-restoration. Homogeneity conditions, on which the well-known redundancy bound 1/(d???-1) holds for a network, are also identified, where d??? is the average nodal degree.
Rate variable, multi-binary turbo codes with controlled error-floor
Authors: Marco Ferrari, Sandro Bellini
Venue: IEEE Transactions on Communications (2009)

In this letter we propose rate variable turbo codes based on the parallel concatenation of tailbiting Recursive Systematic multi-binary (m-ary) convolutional codes. Rate variability is not achieved by puncturing, which can have adverse effects on the minimum distance of the code. Using a variable number of input lines of the encoder, we obtain several different overall rates ranging from 1/2 to 7/8. The most suitable Soft-In-Soft-Out decoding algorithm for these turbo codes is based on the Dual Reciprocal Code, which is very efficient for high rate codes. A particular interleaver design, namely the "backbone" interleaver, guarantees a high Hamming weight in codewords with information weight 2 and 3, as well as good minimum distances and fairly low multiplicities for higher information weights. Therefore, these codes have very low error floors.
The Current Situation and Prospect of Localization in Wireless Sensor Network
Authors: Wenhao Huang, Yu Wang, Haoran Guan
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 01 (2009)

Node localization which is determining where a given node is physically or relatively located is extremely crucial for most of the applications in wireless sensor network. In this article, we review and describe the taxonomy and fundamental localization methods. The current research in WSN localization algorithms are introduced, analyzed and concluded. The point is that no single algorithm performs best, there is significant room for improvement in tradeoff between high accuracy and low expense, energy cost. At last, we proposed the idea of combining many algorithms to make it more accurate and applicable and using artificial intelligence (AI) in mobile localization.
Rate optimization to minimize distortion for source-channel coded H-BLAST with SIC decoding
Authors: Jinho Choi, Jeongseok Ha
Venue: IEEE Communications Letters (2009)

As joint source and channel coding schemes, layered transmission schemes for a successive refinable source (SRS) are recently studied over quasi-static fading channels. In this letter, we consider spatial layered transmission for a SRS with successive interference cancellation (SIC) decoder over quasi-static multi-input multi-output (MIMO) fading channels. We show that if the distortion function can be factorized, the minimum average distortion can be obtained by individual rate optimization for each layer when zero-forcing (ZF) SIC receiver is employed over Rayleigh fading channels.
A case for probabilistic logic for scalable patent retrieval
Authors: Iraklis A. Klampanos, Hany Azzam, Thomas Roelleke
Venue: Proceeding of the 2nd international workshop on Patent information retrieval (2009)

Patent retrieval has emerged as an important application of information retrieval. Inherent properties of patent searching, such as large corpora, document length and the use of terminology have created the need for alternative approaches to searching. Logic-based information retrieval, as it is modelled by DB+IR systems, can accommodate these needs through its power of abstraction and the use of database-friendly query languages. However, there is a trade-off between expressiveness and efficiency. We propose to tackle such efficiency issues through distribution and parallelisation. In this paper we present our arguments in favour of a parallelised patent searching solution built on top of a probabilistic DB+IR system. Our contributions are both conceptual as well as technical. We demonstrate the flexibility of this approach by modelling two resource selection algorithms in probabilistic logic, expressed in probabilistic Datalog -- a rule-based language designed for expressing database-related tasks. Then, we provide early experimental indications which support the feasibility and technical soundness of this approach.
A framework to analyze argumentative knowledge construction in computer-supported collaborative learning
Authors: Armin Weinberger, Frank Fischer
Venue: Computers Education (2006)

Computer-supported collaborative learning (CSCL) is often based on written argumentative discourse of learners, who discuss their perspectives on a problem with the goal to acquire knowledge. Lately, CSCL research focuses on the facilitation of specific processes of argumentative knowledge construction, e.g., with computer-supported collaboration scripts. In order to refine process-oriented instructional support, such as scripts, we need to measure the influence of scripts on specific processes of argumentative knowledge construction. In this article, we propose a multi-dimensional approach to analyze argumentative knowledge construction in CSCL from sampling and segmentation of the discourse corpora to the analysis of four process dimensions (participation, epistemic, argumentative, social mode).
Design and implementation of netCDF markup language (NcML) and its GML-based extension (NcML-GML)
Authors: Stefano Nativi, John Caron, Ethan Davis, Ben Domenico
Venue: Computers Geosciences (2005)

The Network Common Data Form (netCDF) is one of the primary methods of self-documenting data storage and access in the international geosciences research and education community and beyond. NetCDF was designed for use in a networked environment. The recent evolution toward web services approaches to data exchange has focused attention on communication via messages in the defacto standard XML language. XML is a text-based language while netCDF is based on a binary file storage mechanism; thus NcML is a natural augmentation of netCDF with extensions encapsulating descriptions of the structure and content of netCDF objects in an XML form. Since netCDF was designed to be self-documenting, the XML representation of internal netCDF documentation is a natural augmentation of the original netCDF concept. In fact, the netCDF Markup Language (NcML) and NcML-G (NcML-Geography) extensions described in this article have applications beyond merely representing the internal netCDF documentation in the XML language. The NcML coordinate system makes it possible to describe the coordinate system used to represent the netCDF dataset. Furthermore the NcML dataset is a tool for describing ''virtual netCDF'' files that may be aggregations of data from several existing netCDF files, or it can represent a target dataset to be created by transforming existing netCDF files into a new form described in the NcML language. The NcML-G extension provides a means for fusing the data models of the traditional netCDF atmospheric science community with those of the GIS community which is of the utmost importance. Bringing the data models and data systems of those communities together will foster an era of interdisciplinary research and education within the geosciences subdisciplines. It will also encourage closer interactions between the geosciences and the societal impacts community. The design and software implementation of the core NcML specification and its extensions are presented and discussed.
Generating Side Information Using HVSBM for Wavelet-Based Distributed Video Coding
Authors: Lan Bai, Sheng Fang, Zhe Li
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

The quality of side information influences the overall performance of the Distributed Video Coding (DVC). In this context, this paper proposes a practical scheme of using HVSBM to generate side information for wavelet-based DVC. The decoder uses the hierarchical variable size block matching (HVSBM) motion estimation to do the search process and predict side information, which is used to reconstruct Wyner-Ziv frame jointing with the decoded bit stream of Wyner-Ziv frame. And HVSBM uses the criterion of sum of absolute difference (SAD) to divide block. It shows that at the cost of a little higher complexity overall, the proposed HVSBM scheme obtains more accuracy side information and improves the efficiency of the whole codec. 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
Sustainable development of nautical tourism: case of Croatia
Authors: Ante Munitić, Vinko Vidučić, Frane Mitrović, Ljiljana Vidučić
Venue: Proceedings of the IASTED Asian Conference on Modelling and Simulation (2007)

This paper presents a new model for sustainable development of nautical tourism in the Republic of Croatia based on set model variables: modernization, enlargement and building new ports of nautical tourism, construction of nautical fleet, organization of yachting clubs, building shipyards for nautical fleet, building sports, retail, hotel, catering etc. facilities, and building dry berth hangars, motor service stations and vessel maintenance workshops. The model has given direct growth rates of sustainable development of nautical tourism in the Republic of Croatia with realistic prospects to be achieved. The fundamental scientific hypothesis of this paper is proven by indirect growth rates of above mentioned model variables
Data reduction in scalar airborne gravimetry: Theory, software and case study in Taiwan
Authors: Cheinway Hwang, Yu-Shen Hsiao, Hsuan-Chang Shih
Venue: Computers Geosciences (2006)

The objective of this paper is to present theories of scalar airborne gravimetry and to publish the related software to interested readers for free access. Numerical procedures and techniques are developed to compute velocities and accelerations from GPS-determined positions. A method based on the correlation analysis of raw gravity reading and vertical acceleration of aircraft is used to correct for gravimeter times. A method and a computer program for crossover adjustment of gravity values along survey lines are developed. This method allows flexible selection of a fixed survey line to overcome the rank defect problem. A computer program is developed to compute gravity anomalies while applying corrections of gravimeter position and filtering. Upward and downward continuations of gravity anomalies are performed using Fast Fourier Transform. Using observed airborne gravity data along a survey line and simulated data in Taiwan, all the programs have been validated and produced reliable results.
Short note: A Visual Basic program for analyzing oedometer test results and evaluating intergranular void ratio
Authors: M. Murat Monkul, Okan Önal
Venue: Computers Geosciences (2006)

A visual basic program (POCI) is proposed and explained in order to analyze oedometer test results. Oedometer test results have vital importance from geotechnical point of view, since settlement requirements usually control the design of foundations. The software POCI is developed in order perform the necessary calculations for convential oedometer test. The change of global void ratio and stress-strain characteristics can be observed both numerically and graphically. It enables the users to calculate some parameters such as coefficient of consolidation, compression index, recompression index, and preconsolidation pressure depending on the type and stress history of the soil. Moreover, it adopts the concept of intergranular void ratio which may be important especially in the compression behavior of sandy soils. POCI shows the variation of intergranular void ratio and also enables the users to calculate granular compression index.
Hybrid digital-analog coding with bandwidth compression for Gaussian source-channel pairs
Authors: Yadong Wang, Fady Alajaji, Tamás Linder
Venue: IEEE Transactions on Communications (2009)

Three hybrid digital-analog (HDA) systems, denoted by HDA-I, HDA* and HDA-II, for the coding of a memoryless discrete-time Gaussian source over a discrete-time additive memoryless Gaussian channel under bandwidth compression are studied. The systems employ simple linear coding in their analog component and superimpose their analog and digital signals before channel transmission. Information-theoretic upper bounds on the asymptotically optimal mean squared error distortion of the systems are obtained under both matched and mismatched channel conditions. Allocation schemes for distributing the channel input power between the analog and the digital signals are also examined. It is shown that systems HDA* and HDA-II can asymptotically achieve the optimal Shannon-limit performance under matched channel conditions. Low-complexity and low-delay versions of systems HDA-I and HDA-II are next designed and implemented without the use of error correcting codes. The parameters of these HDA systems, which employ vector quantization in conjunction with binary phase-shift keying modulation in their digital part, are optimized via an iterative algorithm similar to the design algorithm for channel-optimized vector quantizers. Both systems have low complexity and low delay, and guarantee graceful performance improvements for high CSNRs. For memoryless Gaussian sources the designed HDA-II system is shown to be superior to the HDA-I designed system. When applied to a Gauss-Markov source under Karhunen-Loeve processing, the HDA-I system is shown to provide considerably better performance.
Burst mode synchronization of QPSK on AWGN channels using kurtosis
Authors: Jake Gunther, Todd Moon
Venue: IEEE Transactions on Communications (2009)

This paper explores the use of kurtosis in synchronizing with a QPSK burst transmission. The start and end of the burst are a priori unknown and are detected without the use of pilot signals. After frame level synchronization, signal level synchronization is performed. The symbol timing, carrier frequency and carrier phase are recovered without the assistance of known symbols or synchronization words in the data stream, i.e. totally blind synchronization. The performance of frame, symbol and carrier synchronization algorithms is evaluated through computer simulations.
A New Framework of Scalable Video Compression with High Error Resilience Based on Wavelet Using Wyner-Ziv Technique
Authors: Zhe Li, Sheng Fang, Guofu Huang, Lan Bai
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

In recent years, wavelet-based scalable video coding has made a considerable progress, but there are still several problems in the development of WSVC. Such as quantization error accumulation resulted from the open-loop structure of MCTF in coding and the poor error resilient performance of the bit stream. The major goal of this paper is to propose a new framework of scalable video coding based on wavelet using Wyner-Ziv Techniques, which is a new coding structure with high error resilience proposed in resent years. The lowest frequency and the last generated high frequency temporal frames as the base layer are encoded by the EZBC method, and other high frequency temporal frames as the enhancement layer are encoded with Wyner-Ziv coding. The coding efficiency of this scheme is close to MC-EZBC in the error-free scenario and is better than the combination of MC-EZBC and FEC in the error channel. 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