ppxscal/embedding_network huggingface dataset:
Managing Linked Data on the Web: The LinkedMDB Showcase
Authors: Mariano P. Consens
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

The Linking Open Data community project is extending the Web by encouraging the creation of interlinks (RDF links between data items from different datasets identified using dereferenceable URIs). This emerging web of linked data is closely intertwined with the existing web, since structured data items can be embedded into web documents (e.g., RDFa or microformat encoded data), and RDF links can reference classic web pages. Abundant linked data justifies extending the capabilities of web browsers and search engines, and enables new usage scenarios, novel applications and sophisticated mashups.This promising direction for publishing data on the web brings forward a number of challenges. While existing data management techniques can be leveraged to address the challenges, there are unique aspects to managing web scale interlinking. In this presentation, we describe two specific challenges; achieving and managing dense interlinking, and describing data, metadata, and interlinking within and among linked web datasets. Approaches to solve these challenges are showcased in the context of LinkedMDB, the first open linked dataset for movies. LinkedMDB has a large number of interlinks (over a quarter of a million) to other open linked datasets, as well as RDF links to movie-related webpages. 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
On the availability of the CH149 Cormorant fleet
Authors: Raman Pall
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The CH149 Cormorant is the Canadian Forces (CF) designation for the AgustaWestland EH101, the Canadian Air Force's only dedicated search and rescue (SAR) helicopter. Since its procurement, the availability for operations of the CH149 fleet has been less than what was initially predicted. This study was undertaken to determine if the low serviceability of the fleet was due to its maintenance programme. A discrete-event simulation model was created to determine the number of aircraft available at any given time during a simulation run, assuming an ideal sparing situation. Analysis indicates that the current fleet cannot operate from four (or even three) Main Operating Bases (MOBs) in an ideal sparing situation, implying that the fleet's availability problem cannot theoretically be solved simply by addressing the logistical problem of the spares.
Privacy-preserving revocation checking
Authors: M. Narasimha, J. Solis, G. Tsudik
Venue: International Journal of Information Security (2009)

Digital certificates signed by trusted certification authorities (CAs) are used for multiple purposes, most commonly for secure binding of public keys to names and other attributes of their owners. Although a certificate usually includes an expiration time, it is not uncommon that a certificate needs to be revoked prematurely. For this reason, whenever a client (user or program) needs to assert the validity of another party&#x2019;s certificate, it performs a certificate revocation check. There are several revocation techniques varying in both the operational model and underlying data structures. One common feature is that a client typically contacts some third party (whether trusted, untrusted or semi-trusted) and obtains some evidence of either revocation or validity (non-revocation) for the certificate in question. While useful, revocation checking can leak sensitive information. In particular, third parties of dubious trustworthiness can discover the identity of the party performing the revocation check, as well as the target of the check. The former can be easily remedied with techniques such as onion routing or anonymous web browsing. Whereas, hiding the target of the query is not obvious. This paper focuses on the privacy in revocation checking, explores the loss of privacy in current revocation checking techniques and proposes simple and efficient privacy-preserving techniques for two well-known revocation methods.
Extensive Questions
Authors: Emmanuel J. Genot
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

Olsson and his collaborators have proposed an extension of Belief Revision Theory where an epistemic state is modeled as a triple $S=\langle{\underline{K},E,\underline{A}}\rangle$, where $\underline{A}$ is a research agenda, i.e. a set of research questions. Contraction and expansion apply to states, and affect the agenda. We propose an alternative characterization of the problem of agenda updating, where research questions are viewed as blueprints for research strategies. We offer a unified solution to this problem, and prove it equivalent to Olsson's own. We conclude arguing that: (i) our solution makes the idea of `minimal change' in questions and agendas clearer; (ii) can be extended in ways the original theory was not, and may help better realize the aims this theory was proposed for; (iii) unveils some limitations of the initial approach, yet opening a way to overcome them. 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
Primal-dual subgradient methods for convex problems
Authors: Yurii Nesterov
Venue: Mathematical Programming: Series A and B (2009)

In this paper we present a new approach for constructing subgradient schemes for different types of nonsmooth problems with convex structure. Our methods are primal-dual since they are always able to generate a feasible approximation to the optimum of an appropriately formulated dual problem. Besides other advantages, this useful feature provides the methods with a reliable stopping criterion. The proposed schemes differ from the classical approaches (divergent series methods, mirror descent methods) by presence of two control sequences. The first sequence is responsible for aggregating the support functions in the dual space, and the second one establishes a dynamically updated scale between the primal and dual spaces. This additional flexibility allows to guarantee a boundedness of the sequence of primal test points even in the case of unbounded feasible set (however, we always assume the uniform boundedness of subgradients). We present the variants of subgradient schemes for nonsmooth convex minimization, minimax problems, saddle point problems, variational inequalities, and stochastic optimization. In all situations our methods are proved to be optimal from the view point of worst-case black-box lower complexity bounds.
On the Stopping Distance and Stopping Redundancy of Finite Geometry LDPC Codes
Authors: Hai-yang Liu, Xiao-yan Lin, Lian-rong Ma, Jie Chen
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The stopping distance and stopping redundancy of a linear code are important concepts in the analysis of the performance and complexity of the code under iterative decoding on a binary erasure channel. In this paper, we studied the stopping distance and stopping redundancy of Finite Geometry LDPC (FG-LDPC) codes, and derived an upper bound of the stopping redundancy of FG-LDPC codes. It is shown from the bound that the stopping redundancy of the codes is less than the code length. Therefore, FG-LDPC codes give a good trade-off between the performance and complexity and hence are a very good choice for practical applications.
Extending Matching Model for Semantic Web Services
Authors: Alireza Zohali, Kamran Zamanifar, Naser Nematbakhsh
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

The Semantics-based Web Service Matching Model is proposed in this paper to improve the performance of Web Service discovery. Semantics-based Web Service Matching is a two-phase method including semantic similarity matching and qualitative filtering. Function-based semantic similarity matching used of matching algorithm in order to finding the most proper services. And also, used for selecting the best service among results of qualitative filtering.
Learning Bayesian Networks: A MAP Criterion for Joint Selection of Model Structure and Parameter
Authors: Carsten Riggelsen
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

For learning Bayesian Network (BN) structures, it has become common practice to use the Bayesian Dirichlet (BD) scoring criterion. In contrast to most other scoring metrics that functionally can be interpreted as regularized maximum likelihood criteria, the BD metric cannot be considered as such. The functional dissimilarity of the BD metric compared to other metrics is an obstacle from an analytical point of view; this is for instance becomes clear in the context of the Structural EM algorithm for learning BNs from incomplete data. Also, it is not easy to pin-point why exactly and to what extend regularization is taken care of by applying the BD metric. We introduce a Bayesian scoring criterion that is closely related to the BD metric, but solves the obvious disadvantages of the BD metric. We arrive at this result by using the same basic assumptions as for the BD metric, but in contrast to the BD metric, where focus is on learning the model structure only, we aim at learning the most probable BN pair jointly, i.e., model structure and the parameter are selected as a pair. This approach yields a scoring metric that has the functional form of a regularized maximum likelihood metric. We perform experiments, and show that this MAP BN metric also yields better results than the BIC and BD metrics on independent test data.
Effect of fidelity in diagram presentation
Authors: Louise Yeung, Beryl Plimmer, Brenda Lobb, Douglas Elliffe
Venue: Proceedings of the 22nd British HCI Group Annual Conference on HCI 2008: People and Computers XXII: Culture, Creativity, Interaction - Volume 1 (2008)

The visual fidelity (fidelity) of a design diagram affects perception and design performance. Hand-drawn diagrams are more effective working documents for early design tasks such as user interface designs than the equivalent computer-prepared formal representation. However people prefer more formal representations because they feel that hand-drawn diagrams look unprofessional. Sketch-based design tools make it possible to present partially tidied designs. We have postulated intermediary levels of visual fidelity in a systematic manner and implemented these levels into a sketch tool to evaluate the effect of computerization and fidelity on perception and design performance. Our findings show that: performance decreased systematically with increased fidelity; that computer presented designs decreases performance and that performance was decreased by computerization of the hand-drawn diagrams. In contrast, user satisfaction was higher with increasing levels of fidelity. These results pose challenges to the sketch tools community and further questions for effective computer support for early design.
V-Compiler: a next-generation tool for microprogramming
Authors: Dave Patterson, Ross Goodell, Michael D. Poe, Simon C. Steely,  Jr.
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Microprogramming has always been a difficult task. Related to hardware and software, it seems to have inherited difficulties from both. Microprogramming has the classic reliability and maintainability problems of software and from hardware it has inherited size and speed efficiency as practically the only measure of success. This legacy has made microprogramming a very difficult task. Falk summarized the state of microprogramming today: At present, microprogramming is an elite activity, performed effectively only by a small number of expert practitioners. The work is detailed, precise, time-consuming, and considerably more expensive than present-day software programming.
Real life is an odyssey: proposal for a videogame linked to reality
Authors: Yukari Hori, Masaki Iwabuchi, Akira Baba
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

The strong attractiveness held by games is a very useful tool for content development. To demonstrate this, we propose a game linked to reality. In addition, it is sometimes feared that games often facilitate estrangement from the real world, but this system promotes associations with reality instead. The game was publicly exhibited and obtained a favorable reception.
Recognition of Off-Line Handwritten Chinese Character by Using Decision Tree Based on Hiberarchy Decomposition
Authors: Dong Liu, Xiangnian Huang
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Decision tree based on hiberarchy decomposition is a kind of improved ID3 algorithm. It splits the training set by choosing different key attributes in different layers according to the correlation between classes and attributes. Compared with traditional ID3 algorithm, its rules are simpler and more general. This paper uses the hiberarchy decomposition methods as well as the C4.5 algorithm and makes some adjustments to deal with the recognition of off-line handwritten Chinese character by constructing a multi-level decision tree. At last, get a scheme of rough classification and analyze the results with different attributes. Compared with the single decision tree, the decision tree based on hiberarchy decomposition has more advantages when dealing with the multi-class problem. Experiment results show that this new method has better accuracy rate.
Stochastic problems in H∞ and H2/H∞ control
Authors: M. E. Shaikin
Venue: Automation and Remote Control (2009)

We consider stochastic control systems subjected simultaneously to stochastic and determinate perturbations. Stochastic perturbations are assumed to be state-multiplicative stochastic processes, while determinate perturbations can be any processes with finite energy on infinite time interval. The results of the determinate H ¿-theory are compared to their stochastic analogs. The determinate and stochastic theories are linked together by the lemma that establishes the equivalence between the stability and boundness of the ¿L¿¿ < ¿ norm of the perturbation operator L, from one side, and the solvability of certain linear matrix inequalities (LMIs), from the other side. As soon as the stochastic version of the lemma is proven, the ¿-controller analysis and design problems are solved, in general, identically in the frame of the united LMI methodology.
Computing Best Swaps in Optimal Tree Spanners
Authors: Shantanu Das, Beat Gfeller, Peter Widmayer
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

In a densely connected communication network, represented by a graph G with nonnegative edge-weights, it is often advantageous to route all communication on a sparse, spanning subnetwork, typically a spanning tree of G. With the communication overhead in mind, we consider a spanning tree T of G which guarantees that for any two nodes, their distance in T is at most k times their distance in G, where k, called the stretch, is as small as possible. Such a spanning tree which minimizes the stretch is called an optimal tree spanner, and it can be used for efficient routing. However, for a communication tree, the failure of an edge is catastrophic; it disconnects the tree. Functionality can be restored by connecting both parts of the tree with another edge, while leaving the two parts themselves untouched. In situations where the failure can be repaired rapidly, such a quick fix is preferred over the recomputation of an entirely new optimal tree spanner, because it is much closer to the previous solution and hence requires far fewer adjustments in the routing scheme. We are therefore interested in the problem of finding for any possibly failing edge in the spanner T a best swap edge to replace it. The objective here is naturally to minimize the stretch of the new tree. We show how all these best swap edges can be computed in total time O(m 2 logn) in graphs with arbitrary nonnegative edge weights. For graphs with unit weight edges (also called unweighted graphs), we present an O(n 3) time algorithm. Furthermore, we present a distributed algorithm for computing the best swap for each edge in the spanner.
Deploying Wireless Networks, 1st edition
Authors: Andy Wilton, Tim Charity
Venue:  (2008)

Wireless operators will find this practical, hands-on guide to network deployment invaluable. Based on their own extensive experience, the authors describe an end-to-end network planning process to deliver the guaranteed Quality of Service (QoS) that enables today's wireless IP services such as VoIP, WWW and streaming video. With a focus on practical design, comprehensive examples are provided for GSM/GPRS/EDGE UMTS/HSDPA OFDM Mesh Wifi Packet backhaul Topics addressed include: capacity/peak data rates, service latency link budgets lifecycle costs network optimisation The trade-off between enhanced user experience and operator cost is explored in the context of an enhanced business model. Suitable for radio and core network planners, designers, optimizers, and business development staff at operators and network equipment manufacturers, the book's extensive references also make it a useful resource for graduate and postgraduate students.
A Rate Control Scheme of the Even Low Bit-rate Video Encoder
Authors: Bing Zhou, Shi-Mei Su, Xingjin Zhang, Xiaoqiang Li
Venue: International Journal of Distributed Sensor Networks (2009)

Rate control plays an important role in transmitting low-delay and high-quality images over the channel of very low bandwidth. The rate control algorithm in MPEG-4 or H.26X only defined the rate control model of P-frame, and did not introduce the rate control model of I-frame as it supposed that only the first frame is an I-frame, the others are all P-frames. However, in practical applications, a certain number of I-frames have to be inserted to meet the demand for fault-tolerant transmission and information retrieval. Oriented toward the application demand of remote surveillance system based on PSTN, a rate control strategy is proposed for encoding video at even low bit-rate in this paper. The strategy includes a rate-control algorithm for I-frame and introduces a quadratic rate distortion model, which solves the problem of the rate control used at very low bit-rate preferably. The rate distortion model of I-frame is designed referring to that of P-frame. It mainly involves three processes: initial quantization parameter calculation, objective bit number allocation, and objective quantization parameter calculation. TM5 of MPEG-2 proposed the target bit-number allocation model of I, P, and B frame, but the algorithm for the model is a bit complex. Based on the quadratic rate distortion model, a novel algorithm for the target bit-number allocation is presented in this paper. In order to keep the stability of image quality, VM8 limits the change range of the new quantization parameter from -0.25 to 0.25 times of the previous frame. As a result, if the previous frame's quantization parameter is small but the current frame's quantization parameter is calculated to be large, the current frame's quantization parameter should have been corrected with a small value, which will cause excessive coding bits, and worsen the transmission delay. In this paper, we present a correction algorithm for the computation of P-frame's quantization parameter. The results of experiments show that the proposed scheme reduces the delay of encoder buffering greatly, and improves the quality of reconstructed images clearly at the same time. In terms of the system's transmission delay, our scheme uses reasonable algorithms for computing the quantization parameters of I-frame and P-frame, and adjusting the GOP length dynamically. The transmission delays are significantly decreased and the buffer overflows are avoided. In terms of the reconstructed image quality, the test sequence's PSNRs with our scheme are higher than VM8's at all the bit rates, and the coded bit-number of our scheme is less than VM8's at the same bit rate. In terms of the deviation of output bit-streams, the average deviation of our algorithm is much less than VM8's. The less the deviation of the output bit-stream is, the more appropriate it is to be transmitted at the given bandwidth, and the less the transmission delay is.
Challenge of knowledge sharing: integrating customer in product development
Authors: Seppo Sirkemaa
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Development of products and services requires information on customer needs. In many cases there are several people interfacing with customers throughout the organization. Information can be highly shattered, unorganized and not codified. One of the key issues is that the people who are interacting with customers may be other than those who are involved with development of products and services. Here the challenge is to integrate information and knowledge from customer needs to the R&D process. There are mechanisms for sharing information so that it can be effectively used in R&D process. Knowledge sharing mechanisms become especially important in a large organization which operates in multiple locations. These call for infrastructures, rules and procedures. In this paper we study mechanisms that empower the sharing of knowledge and information between individuals, especially customer feedback is the focus of this research.
L-Broyden methods: a generalization of the L-BFGS method to the limited-memory Broyden family
Authors: M. B. Reed
Venue: International Journal of Computer Mathematics (2009)

The paper derives a multiplicative update equation for the convex Broyden family of quasi-Newton (QN) updates. The well-known multiplicative Broyden-fletcher-Goldfarb-Shanno (BFGS) update is a special case of this. Using a self-scaling parameter, the formula is extended to the SR1 update. It is shown that for each Broyden update, a pair of multiplicative update formulae can be defined (coincident in the case of Davidon-fletcher-Powell (DFP)). The multiplicative updates are used to define limited-memory QN algorithms, denoted the L-Broyden methods, of which L-BFGS is a special case. Numerical results show that the L-Broyden methods are competitive with extensions of the variable storage conjugate gradients limited memory QN method to other Broyden updates, but that L-BFGS with Shanno scaling remains the most efficient and reliable method in the L-Broyden family.
Radio-over-fiber system based on stimulated Brillouin scattering
Authors: Chung Ghiu Lee, Chul Soo Park
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

We describe the radio-over-fiber (RoF) system technology based on stimulated Brillouin scattering (SBS). The functional blocks for the broadband RoF system are implemented, photonic upconversion method and photonic frequency tripling method based on SBS. Photonic frequency upconverter is implemented at the central station to up-convert the baseband data to the high frequency in optical domain. By adopting this upconversion method, error-free transmission of the 1.25-Gb/s pseudorandom bit sequence is demonstrated including remote distribution through the optical fiber.