ppxscal/embedding_network huggingface dataset:
Strongly Secure Linear Network Coding
Authors: Kunihiko Harada, Hirosuke Yamamoto
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In a network with capacity h for multicast, information Xh = (X1, X2, ₀, Xh) can be transmitted from a source node to sink nodes without error by a linear network code. Furthermore, secret information Sr = (S1, S2, ₀, Sr) can be transmitted securely against wiretappers by k-secure network coding for k ≤ h-r. In this case, no information of the secret leaks out even if an adversary wiretaps k edges, i.e. channels. However, if an adversary wiretaps k + 1 edges, some Si may leak out explicitly. In this paper, we propose strongly k-secure network coding based on strongly secure ramp secret sharing schemes. In this coding, no information leaks out for every (Si1, Si2, ₀, Sir-j) even if an adversary wiretaps k ± j channels. We also give an algorithm to construct a strongly k-secure network code directly and a transform to convert a nonsecure network code to a strongly k-secure network code. Furthermore, some sufficient conditions of alphabet size to realize the strongly k-secure network coding are derived for the case of k < h-r.
On d-solvability for linear differential equations
Authors: An Khuong Nguyen
Venue: Journal of Symbolic Computation (2009)

The aim of this paper is to investigate the possibility of solving a linear differential equation of degree n by means of differential equations of degree less than or equal to a fixed d, 1@?d
Network Fault Diagnosis Using Hierarchical SVMs Based on Kernel Method
Authors: Li Zhang, Xiangru Meng, Hua Zhou
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

A new method based on kernel which can measure class separability in feature space is proposed in this paper for existing error accumulation when the Hierarchical SVMs is used to diagnose multi-class network fault. This method has defined metrics of sample distribution in feature space, which are used as the rule of constructing Hierarchical SVMs. Experiment results show that this method can restrain error accumulation and has higher multi-class classification accuracy, and offer an effective way for Network fault diagnosis.
Edge-choosability of planar graphs without non-induced 5-cycles
Authors: Jiansheng Cai, Jianfeng Hou, Xia Zhang, Guizhen Liu
Venue: Information Processing Letters (2009)

A graph G is edge-L-colorable, if for a given edge assignment L={L(e):e@?E(G)}, there exits a proper edge-coloring @f of G such that @f(e)@?L(e) for all e@?E(G). If G is edge-L-colorable for every edge assignment L with |L(e)|>=k for e@?E(G), then G is said to be edge-k-choosable. In this paper, we prove that if G is a planar graph without non-induced 5-cycles, then G is edge-k-choosable, where k=max{7,@D(G)+1}.
Formal Ontology in Information Systems: Proceedings of the Fifth International Conference (FOIS 2008) - Volume 183 Frontiers in Artificial Intelligence and Applications
Authors: C. Eschenbach, M. Gruninger
Venue:  (2008)

Since its start ten years ago, the International Conference in Formal Ontology on Information Systems (FOIS) has explored the multiple perspectives on the notion of ontology that have arisen from such diverse research communities as philosophy, logic, computer science, cognitive science, linguistics, and various scientific domains. As ontologies have been applied in new and exciting domains such as the World Wide Web, bioinformatics and geographical information systems, it has become evident that there is a need for ontologies that have been developed with solid theoretical foundations based on philosophical, linguistic and logical analysis. Similarly, there is also a need for theoretical research that is driven by the issues that have been raised by recent work in the more applied domains. FOIS is intended to be a forum in which to explore this interplay between the theoretical insights of formal ontology and their application to information systems and emerging semantic technologies. Themes emerging from this volume give a snapshot of current issues within the fields of formal ontology and ontological engineering, as well as providing a glimpse of future research directions.
Efficient Numerical Integration Method for Dynamic of Flexible Space Robots System
Authors: Fuyang Tian, Hongtao Wu, Hongli Sun
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

As space robots gain more and more importance in space operations, it was becoming imperative to understand their distinctive dynamics. The dynamics model of the space flexible robots is very complex, and the differential equation derived from dynamics was solved difficultly and slowly. In this paper the dynamics of space flexible robots was discussed, and the fast efficient integration method was used to solve this complex differential equation. Simulations results show that the dynamic modeling and fast efficient numerical integration techniques of flexible space robot proposed in this paper are very useful.
Multi-phase (6-phase & 12-phase) power transmission systems with thyristor controlled series capacitor
Authors: Zakir Husain, R. K. Singh, S. N. Tiwari
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

Multi-phase (employing phases more than three) power transmission systems have been investigated as a potential alternative to conventional three-phase systems for bulk power transmission at EHV and UHV levels in the past. The technology has been found to be effective to remove some of the limitations of three-phase system arising out of the use of extremely high voltages to increase power capability of lines, excessive rights-of-way (ROW) requirement and several environmental problems. A recently conducted survey reveals that the integration of flexible A.C. transmission system (FACTS) devices into conventional three-phase transmission system for enhancement and control of power flow is well established, however, this aspect has not been investigated for multi-phase power transmission systems. This paper therefore attempts to study: a FACTS device i.e. thyristor controlled series capacitor (TCSC), its model and effect on power flow and load ability of multi-phase EHV transmission lines. Sample systems are employed to study quantitative benefits of six-phase and twelve-phase lines over their three-phase counter parts.
Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times
Authors: Binay Bhattacharya, Paz Carmi, Yuzhuang Hu, Qiaosheng Shi
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

In this paper, we consider the single vehicle scheduling problem (SVSP) on networks. Each job, located at some node, has a release time and a handling time. The vehicle starts from a node (depot), processes all the jobs, and then returns back to the depot. The processing of a job cannot be started before its release time, and its handling time indicates the time needed to process the job. The objective is to find a routing schedule of the vehicle that minimizes the completion time. When the underlying network is a path, we provide a simple 3/2-approximation algorithm for SVSP where the depot is arbitrarily located on the path, and a 5/3-approximation algorithm for SVSP where the vehicle's starting depot and the ending depot are not the same. For the case when the network is a tree network, we show that SVSP is polynomially approximable within 11/6 of optimal. All these results are improvements of the previous results [2,4]. The approximation ratio is improved when the tree network has constant number of leaf nodes. For cycle networks, we propose a 9/5-approximation algorithm and show that SVSP without handling times can be solved exactly in polynomial time. No such results on cycle networks were previously known.
GSM/GPRS coverage study for general aviation applications
Authors: Luis Serrano, Juan Antonio Romo, Iñigo Odriozola, Javier Bilbao, Gerardo Aranguren
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

Land GSM/GPRS networks currently offer coverage at terrestrial surface level in almost anywhere and anytime. The mobile network operators have optimized this surface coverage by means of planning two-dimensional cells to cover the whole offered service area. The planning has not considered the possibility that these networks could provide service to the heights of flight employed by general aviation. In this paper a study of the signal radiated by mobile telephony antennas currently installed in the direction toward the sky, till heights of about 3000 meters, is shown. The measurement system used in hot-air balloon and in light aircraft flights is also presented. Finally the data collected are represented and compared with the simulated theoretical values.
Spatial statistical properties and scale transform analyses on the topographic index derived from DEMs in China
Authors: Bin Yong, Wan-Chang Zhang, Guo-Yue Niu, Li-Liang Ren, Cheng-Zhi Qin
Venue: Computers Geosciences (2009)

The topographic index (TI), frequently used in approximately characterizing the spatial distribution of variable source areas within a watershed, has been widely applied in topography-based land-surface process schemes coupled in regional or global climatic models. The TI concept, however, was originally developed for studying hill-slope scale hydrological processes and was most commonly used in simulations from small- to medium-sized watersheds. It is still questionable whether the TI computed from coarse-resolution digital elevation models (DEMs) for large-scale hydrology and climate studies can effectively reflect the spatial distribution of soil moisture, surface saturation, and runoff generation processes in most areas. In this study, we first proposed an improved multiple flow direction algorithm (IMFD) for accurately computing the TI distribution. We then evaluated the IMFD algorithm quantitatively by using four types of artificial mathematical surfaces. Subsequently, we conducted statistical analyses on the TI distributions computed with IMFD from 90x90m^2 and 1000x1000m^2 resolution DEM blocks sampled from across the whole of China. We found there are linear relationships between the mean TI values computed from the two different resolution DEMs in three sampled blocks of different sizes, i.e., 0.1^ox0.1^o, 0.5^ox0.5^o and 1^ox1^o. Systematic analyses further suggested that the forms of these linear relationships are evidently affected by the algorithm used for the TI computation, while the size, location, and number of the selected TI samples have minor effects on them. Finally, we investigated the influence of DEM resolution on the spatial statistical properties of TI. From the viewpoint of terrain discretization and smoothing effects, we also discussed the mechanism and the reasons causing the similarity on TI at different spatial resolutions.
Selection of Wavelet Filters for Panoramic Dental X-Ray Image Compression
Authors: Pusit Borwonwatanadelok, Boonchana Purahong, Somkait Udomhunsakul
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Recently, wavelet transform has proven to be very effective in medical image compression. However, the choice of wavelet filters is a vital factor that can be determined the compression performance. The aim of this paper is to investigate the effect of applying different types of wavelet filters belonging to orthogonal and biorthogonal wavelets with different orders on the panoramic dental x-ray images. The wavelet filters used are Haar, Daubichies8, 6/10, 9/7 and 5/3 filters. The performance evaluation of the image quality is measured objectively using peak signal to noise ratio and blocking artifact measurement. The almost simulated results reveal that 9/7 irreversible wavelet transform is the best choice for lossy panoramic dental x-ray image compression.
Frequency-Domain Adaptive Filtering of Batch Dealing Used for GPS Anti-jamming
Authors: Hongtao Song, Lin Zhao, Jicheng Ding, Ming Sun
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

By analyzing the common method of LMS (Least-mean-square) frequency-domain adaptive filtering of batch dealing used for GPS (Global Positioning System) anti-jamming, the paper points out the shortage and gives a novel algorithm, the performance of which dose not depend on the initial parameters. Both LMS algorithm and the proposed one are first introduced in detail, and then the computer simulation results for LMS and the proposed algorithm show that the latter is better.
From Information System to Decision Support System
Authors: Alicja Wakulicz-Deja, Agnieszka Nowak
Venue: Transactions on Rough Sets IX (2008)

In the paper we present the definition of Pawlak's model of an information system. The model covers information systems with history, systems with the decomposition of objects or attributes and dynamical information systems. Information systems are closely related to rough set theory and decision support systems. The aim of the paper is to characterize the stimulated by Professor Pawlak research of the group in Silesian University in information retrieval based on different information systems and in decision support based on rough sets, and to outline the current research projects of this group on modern decision systems.
Fault-free longest paths in star networks with conditional link faults
Authors: Ping-Ying Tsai, Jung-Sheng Fu, Gen-Huey Chen
Venue: Theoretical Computer Science (2009)

The star network, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each node is assumed to be incident with two or more fault-free links, we show that an n-dimensional star network can tolerate up to 2n-7 link faults, and be strongly (fault-free) Hamiltonian laceable, where n>=4. In other words, we can embed a fault-free linear array of length n!-1 (n!-2) in an n-dimensional star network with up to 2n-7 link faults, if the two end nodes belong to different partite sets (the same partite set). The result is optimal with respect to the number of link faults tolerated. It is already known that under the random fault model, an n-dimensional star network can tolerate up to n-3 faulty links and be strongly Hamiltonian laceable, for n>=3.
JPEG Compatible Raw Image Coding Based on Polynomial Tone Mapping Model
Authors: Masahiro Okuda, Nicola Adami
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we propose a coding method for camera raw images with high dynamic ranges. Our encoder has two layers. In the first layer, 24 bit low dynamic range image is encoded by a conventional codec, and then the residual image that represents the difference between the raw image and its approximation is encoded in the second layer. The approximation is derived by a polynomial fitting. The main advantage of this approach is that applying the polynomial model reduces the correlation between the raw and 24 bit images, which increases coding efficiency. Experiments shows compression efficiency is significantly improved by taking an inverse tone mapping into account.
From stakeholder goals to product features: towards a role-based variability framework with decision boundary
Authors: Catalin Bidian
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

Variability in complex software systems arises from the diverse characteristics, views, preferences, and goals of stakeholders. Recent variability research focuses on stakeholders' goals, using models, to analyze the space of alternative solutions for software functionalities. In our study we extend the goals-requirements-features approach by considering variability along multiple product development stages. We depict variability at the early and late requirements definition stage, architecture design, detailed design, and runtime, proposing a role-based framework for variability analysis. Variability design involves the placement of a decision boundary to identify the space of alternative features that can be left 'open' for the next stage of product decisions. We also analyze softgoals variability to allow early identification of variation points in the product architecture.
Image Denoising Using Weighted Averaging
Authors: Zhou Dengwen, Shen Xiaoliu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Guleryuz proposed a simple and powerful image denoising algorithm using weighted averaging based on DCTs. The shortcomings of Guleryuz's method are that it needs to train two threshold parameters and its denoising ability deteriorates when noise level becomes high. In this paper, we give a method which trains the two parameters. We also improve Guleryuz's method via local Wiener filtering. Our method only needs to train a threshold parameter and also performs significantly better than Guleryuz's method.
A new policy for the service request assignment problem with multiple severity level, due date and SLA penalty service requests
Authors: Anshul Sheopuri, Sai Zeng, Chitra Dorai
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We study the problem of assigning multiple severity level service requests to agents in an agent pool. Each severity level is associated with a due date and a penalty, which is incurred if the service request is not resolved by the due date. Motivated by Van Meighem (2003), who shows the asymptotic optimality of the Generalized Longest Queue policy for the problem of minimizing the due date dependent expected delay costs when there is a single agent, we develop a class of Index-based policies that is a generalization of the Priority First-Come-First-Serve, Weighted Shortest Expected Processing Time and Generalized Longest Queue policy. In our simulation study of an assignment system of a large technology firm, the Index-based policy shows an improvement of 0--20 % over the Priority First-Come-First-Serve policy depending upon the load conditions.
A reproducing kernel hilbert space framework for spike train signal processing
Authors: António R. C. Paiva, Il Park, José C. Príncipe
Venue: Neural Computation (2009)

This letter presents a general framework based on reproducing kernel Hilbert spaces (RKHS) to mathematically describe and manipulate spike trains. The main idea is the definition of inner products to allow spike train signal processing from basic principles while incorporating their statistical description as point processes. Moreover, because many inner products can be formulated, a particular definition can be crafted to best fit an application. These ideas are illustrated by the definition of a number of spike train inner products. To further elicit the advantages of the RKHS framework, a family of these inner products, the cross-intensity (CI) kernels, is analyzed in detail. This inner product family encapsulates the statistical description from the conditional intensity functions of spike trains. The problem of their estimation is also addressed. The simplest of the spike train kernels in this family provide an interesting perspective to others' work, as will be demonstrated in terms of spike train distance measures. Finally, as an application example, the RKHS framework is used to derive a clustering algorithm for spike trains from simple principles.
Evolution of Fitness Functions to Improve Heuristic Performance
Authors: Stephen Remde, Peter Cowling, Keshav Dahal, Nic Colledge
Venue: Learning and Intelligent Optimization: Second International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers (2008)

In this paper we introduce the variable fitness function which can be used to control the search direction of any search based optimisation heuristic where more than one objective can be defined, to improve heuristic performance. The method is applied to a multi-objective travelling salesman problem and the performance of heuristics enhanced with the variable fitness function is compared to the original heuristics, yielding significant improvements. The structure of the variable fitness functions is analysed and the search is visualised to better understand the process.
Cognitive support through visualization and focus specification for understanding large class libraries
Authors: Jauhar Ali
Venue: Journal of Visual Languages and Computing (2009)

Effective object-oriented (OO) programming requires understanding class libraries. This paper presents our approach to design and build a cognitive tool that supports a programmer to understand OO class libraries. The MUDRIK system provides (1) three-dimensional visualization mechanisms for representing class structures and relationships from a variety of views and (2) flexible focus specification mechanisms that allow users to adapt a space of components to be displayed according to the task at hand. Interactive views of MUDRIK enable programmers to examine components' detail while maintaining a global representation of the rest of the library. The paper describes why understanding class library is critical in OO programming, presents a cognitive framework of our approach and design rationale behind the system design, and provides a detailed description of the system followed by a discussion on our approach.
Using Capistrano
Authors: Dan Frost
Venue: Linux Journal (2009)

Simplify application deployment.
Receiver-oriented load-balancing and reliable routing in wireless sensor networks
Authors: Min Chen, Victor C. M. Leung, Shiwen Mao, Taekyoung Kwon
Venue: Wireless Communications Mobile Computing (2009)

Routing protocols in wireless sensor networks (WSNs) typically employ a transmitter-oriented approach in which the next hop node is selected based on neighbor or network information. This approach incurs a large overhead when the accurate neighbor information is needed for efficient and reliable routing. In this paper, a novel receiver-oriented load-balancing and reliable routing (RLRR) protocol is proposed. In RLRR, an intermediate node solicits next hop candidates, each of which is to respond with its own backoff time dubbed a temporal gradient (TG). In this way, the next hop is selected without any central coordination on a packet-by-packet basis. Thus, each node needs not maintain any neighbor information. The remaining energy level used to determine the TG is always accurate and up-to-date. Furthermore, neighbor nodes whose hop count is less than the soliciting node participate in the next-hop selection process with loop-free operation guarantee. Comprehensive simulations are carried out to show that RLRR achieves relatively longer network lifetime and higher reliability than other existing schemes. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Personalizing Education in Post-Industrial Society
Authors: Ilya Levin, Andrei Kojukhov
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

The paper deals with significant technological changes in society when it moves into Post-Industrial age. Some of these changes have fundamental social consequences. The paper analyses the main social trends such as Virtualization of the society in their interaction with newest technology trends and their influence on education. The concept of Virtualization allows formulating the main feature of the Post-Industrial education, which is personalization. The phenomenon of personalization is supported by newly developed and introduced personal communication means forming totally person-dedicated, unique learning environment.