ppxscal/embedding_network huggingface dataset:
Evaluation and optimization of a peer-to-peer video-on-demand system
Authors: Bin Cheng, Xiuzheng Liu, Zheng Zhang, Hai Jin, Lex Stein, Xiaofei Liao
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

Video-on-demand (VoD) is increasingly popular with internet users. However, VoD is costly due to the load placed on video servers. Peer-to-peer (P2P) techniques are an approach to alleviating server load through peer-assisted sharing. Existing studies on P2P VoD are mostly based on simulation and focus on areas such as overlay topology, but little is known about the effectiveness of P2P in a real VoD system. In this paper we present a comprehensive measurement study of GridCast, a deployed experimental P2P VoD system. Using a 2-month log of GridCast, we evaluate its scalability and end user experience. Motivated by the observations on user behavior and unused peer resource, we further optimize its performance. Our key findings are: (1) a moderate number of concurrent users can derive satisfactory user experience. However, good network bandwidth at peers and adequate server provisioning are still critical to good user experience; (2) a simple prefetching algorithm can be effective to improve random seeks; (3) a simple caching across multiple videos has great potential to further improve system scalability. Overall, we believe that it is feasible to provide a cost-effective P2P VoD service with acceptable user experience, and there is a fundamental tradeoff between good user experience and system scalability.
Examining pine spectral separability using hyperspectral data from an airborne sensor: An extension of field-based results
Authors: J. A. N. van Aardt, R. H. Wynne
Venue: International Journal of Remote Sensing (2007)

Three southern USA forestry species, loblolly pine (Pinus taeda), Virginia pine (Pinus virginiana), and shortleaf pine (Pinus echinata), were previously shown to be spectrally separable (83% accuracy) using data from a full-range spectroradiometer (400-2500 nm) acquired above tree canopies. This study focused on whether these same species are also separable using hyperspectral data acquired using the airborne visible/infrared imaging spectrometer (AVIRIS). Stepwise discriminant techniques were used to reduce data dimensionality to a maximum of 10 spectral bands, followed by discriminant techniques to measure separability. Discriminatory variables were largely located in the visible and near-infrared regions of the spectrum. Cross-validation accuracies ranged from 65% (1 pixel radiance data) to as high as 85% (3×3 pixel radiance data), indicating that these species have strong potential to be classified accurately using hyperspectral data from air-or space-borne sensors.
Adaptive tuning of scheduling parameters
Authors: Timo Hamalainen, Jarmo Siltanen, Ari Viinikainen, Jyrki Joutsensalo
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

This paper presents WFQ- based scheduling algorithm that allocates network resources in a fair way by taking into account class of service issues. Presented model is flexible in that different traffic flows are grouped into service classes and are given such QoS characteristics as bandwidth and delay. To adjust dynamically weights it is proposed to use the usage-based revenue criterion that enables the allocation of free resource between service classes. The analysis considers a single node and it is shown that the QoS can be guaranteed due to the allocation of unused resources to the higher service classes.
Improved compact thermal model for studying 3-D interconnect structures with low-k dielectrics
Authors: A. Whelan, Y. Joshi, W. King
Venue: Microelectronics Journal (2008)

Compact thermal modeling is gaining significance as interconnect feature sizes continue to shrink, requiring increased computation times for full-field multi-scale simulations. Improved and expanded uses of an existing compact thermal modeling approach found in Gurrum et al. [A compact approach to on-chip interconnect heat conduction modeling using the finite element method, ASME J. Electron. Packaging (2007), accepted], Gurrum et al. [A novel compact method for thermal modeling of on-chip interconnects based on the finite element method, ASME, EEP 3, Electron. Photon. Packing Electr. Syst. Photon. Des. Nanotechnol. (2003) 441-445] are presented here. The first improvement rectifies a singularity that occurs in the previous compact model. This change allows for greater flexibility in mesh application, and a greater number of structures that can be analyzed. This work focuses on the application of the compact thermal model to two interconnect structures. The first geometry [S. Im, N. Srivastava, K. Banerjee, K. Goodson, Scaling analysis of multilevel interconnect temperatures for high performance ICS, IEEE Trans. Electron. Dev. 52 (12) (2005) 2710-2719] is a typical interconnect structure based on the ITRS 65nm technology node. A new transient compact model was applied to another geometry [J. Zhang, M. Bloomfield, J. Lu, R. Gutmann, T. Cale, Thermal stresses in 3D IC inter-wafer interconnects, Microelectron. Eng. 82 (3-4) (2005) 534-547], which is a more advanced technology with a through-the-die via structure. The second improvement of the compact model is extending the steady state finite element based model into a transient version. Full-field simulations have very large storage and memory requirements for transient analysis of complex structures. The advantage of this compact model is that in addition to increased efficiency, the methodology and implementation is similar to a traditional finite element analysis (FEA).
A note on n-tuple colourings and circular colourings of planar graphs with large odd girth
Authors: P. sparl, J. zerovnik
Venue: International Journal of Computer Mathematics (2007)

The existence of planar graphs with odd girth 2k+1 and high girth that cannot be (2k+1, k)-coloured was left as an open question by Klostermeyer and Zhang. In this note we show that such graphs exist for arbitrarily large k. We also show that these graphs have fractional chromatic number greater than 2+1/k.
On the efficacy of prerecorded lectures for teaching introductory programming
Authors: Glenn Smith, Colin Fidge
Venue: Proceedings of the tenth conference on Australasian computing education - Volume 78 (2008)

Teaching introductory programming is a notoriously challenging problem in any information technology or computer science course. Failure and dropout rates are usually high, and many students seem unable to grasp the notion of solving problems algorithmically. Given contemporary students' fondness for multimedia styles of presentation, we conducted an experiment on the effectiveness of providing prerecorded mini-lectures in a first-year programming subject. Although we found only a weak quantitative correlation between students' use of the prerecorded material and their final grades, anecdotal feedback on the experiment was overwhelmingly positive, suggesting that students' perceptions of the subject were improved.
The sequential frequency assignment process
Authors: Sjoert Fleurke, Herold Dehling
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

A mathematical model is developed to describe the behavior of the assignment of frequencies to demands occurring one by one and distributed randomly over a space. The behavior of this Sequential Frequency Assignment Process (SFAP) is studied mainly by Monte Carlo simulations. Several conjectures concerning the long term behavior of SFAP are formulated, e.g. a law of large numbers and a central limit theorem. Also, it is shown that at higher frequencies the densities are higher than at lower frequencies. Finally, the relation of the SFAP with the car parking model and particle deposition models is discussed.
Reducing the Interconnection Network Cost of Chip Multiprocessors
Authors: Pablo Abad, Valentin Puente, Jose Angel Gregorio
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

This paper introduces a cost-effective technique to deal with CMP coherence protocol requirements from the interconnection network point of view. A mechanism is presented to avoid the end-to-end deadlock that arises from the dependency chains created at the network interfaces between the different message types handled by coherence protocols. Our proposal is designed to guarantee a fraction of end-to-end bandwidth for the highest priority messages and makes it unnecessary to employ several virtual networks or complex mechanisms for dealing with the limited capacity of the endpoint buffers. The presented approach uses the Rotary Router as its starting point, extending the original mechanism for the routing-dependent deadlock to the message-dependent deadlock. We also propose a solution that guarantees point-to-point message ordering in this router, which is a common requirement in some coherence protocols. Results for synthetic and parallel applications show that the proposal improves the performance of previous solutions with a much lower hardware cost.
IDMap
Authors: Soyang Ha, Young-Ju Seo, Min-Seok Kwon, Byung-Ha Chang, Cheol-Kyu Han, Jeong-Hyeok Yoon
Venue: Bioinformatics (2008)

Summary: Pharmaceutical industry has been striving to reduce the costs of drug development and increase productivity. Among the many different attempts, drug repositioning (retargeting existing drugs) comes into the spotlight because of its financial efficiency. We introduce IDMap which predicts novel relationships between targets and chemicals and thus is capable of repositioning the marketed drugs by using text mining and chemical structure information. Also capable of mapping commercial chemicals to possible drug targets and vice versa, IDMap creates convenient environments for identifying the potential lead and its targets, especially in the field of drug repositioning. Availability: IDMap executable and its user manual including color images are freely available to non-commercial users at http://www.equispharm.com/idmap Contact: idmap@equispharm.com
A new combination of evidence based on compromise
Authors: Koichi Yamada
Venue: Fuzzy Sets and Systems (2008)

Dempster rule of combination is the standard way of combining multiple pieces of evidence given by independent sources of information. However, it aroused many controversies about its validity, and many alternatives have been proposed. The paper examines the model of combination in Dempster's original paper and indicates that handling of the independence required among multiple pieces of evidence is strange from the viewpoint of semantics, where the independence among occurrences of multiple pieces of information might be confused with the consistency among contents of the information. The paper then proposes a new model of combination and a new rule of combination called combination by compromise as a consensus generator. The properties of the proposed combination as well as several alternative combination methods proposed so far are discussed in the light of the drawbacks and advantages of Dempster rule. Several numerical examples which demonstrate the properties are also shown. The discussion and the examples suggest that the proposed combination produces the most preferable results among them from the viewpoints of consensus generation.
Need to Share vs. Need to Assure
Authors: Linda Wilbanks
Venue: IT Professional (2008)

Regardless of how you define it, information assurance is critical to the success of every company. It's a key responsibility for CIOs and IT managers, as well as everyone who stores or sends data electronically. In most cases, IT managers and CIOs shouldn't get involved in the day-to-day details of quality assurance for software programs, but they are responsible for ensuring that software quality assurance is achieved and that the data on Web sites is accurate and meets company guidelines and federal regulations before it's posted. The CIO is ultimately responsible for software QA as well as for the integrity of the data quality, ensuring that it isn't intentionally or unintentionally altered while at rest, in transmission, or through manipulation or use by a software program.
An Intrusion Detection System in Mobile AdHoc Networks
Authors: SaniKommu Madhavi
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Networks are protected using many firewalls and encryption software’s. But many of them are not sufficient and effective. Therefore an intrusion detection system (IDS) is required that monitors the network, detects misbehavior or anomalies and notifies other nodes in the network to avoid or punish the misbehaving nodes. Numerous schemes have been proposed for Intrusion Detection and Response Systems, for ad hoc networks. The ultimate goal of the security solutions for wireless networks is to provide security services, such as authentication, confidentiality, integrity, anonymity, and availability, to mobile users. In this paper, we examine the vulnerabilities of wireless networks and argue that we must include intrusion detection in the security architecture for mobile computing environment. We propose a mIDS (Mobile Intrusion Detection System) suitable for multi-hop ad-hoc wireless networks, which detects nodes misbehavior, anomalies in packet forwarding, such as intermediate nodes dropping or delaying packets. mIDS does rely on overhearing packet transmissions of neighboring nodes. Simple rules are designed to identify the misbehavior nodes. The proess of identyfing the misbehavior node is carried out by a special node called a monitor node. Periodically monitor node is identified in the network.
INEMO: distributed RF-based indoor location determination with confidence indicator
Authors: Hongbin Li, Xingfa Shen, Jun Zhao, Zhi Wang, Youxian Sun
Venue: EURASIP Journal on Advances in Signal Processing (2008)

Using radio signal strength (RSS) in sensor networks localization is an attractive method since it is a cost-efficient method to provide range indication. In this paper, we present a two-tier distributed approach for RF-based indoor location determination. Our approach, namely, INEMO, provides positioning accuracy of room granularity and office cube granularity. A target can first give a room granularity request and the background anchor nodes cooperate to accomplish the positioning process. Anchors in the same room can give cube granularity if the target requires further accuracy. Fixed anchor nodes keep monitoring status of nearby anchors and local reference matching is used to support room separation. Furthermore, we utilize the RSS difference to infer the positioning confidence. The simulation results demonstrate the efficiency of the proposed RF-based indoor location determination.
Multi-view 3D scanned data registration
Authors: Sushil Bhakar, Ran Wang, Sudhir Mudur
Venue: Proceedings of the 2008 C3S2E conference (2008)

We propose a new algorithm for registering 3D scans obtained from different views of an object. Our work differs from the popular ICP based approach since we minimize error in signed distance function instead of squared distance between sampled surface points themselves. Our experiments show that this yields a fast and robust method of registering 3D scans into a single 3D model, firstly by simplifying point correspondence step, secondly by requiring fewer registration steps and lastly by using nonlinear optimization (the Levenberg-Marquardt algorithm) for error minimization, making the registration converge in fewer iterations. Our approach is also independent of the sampling resolution and works well in the presence of noise. We also believe that the distance-based error formulation lends itself much better for simultaneous registration of multiple overlapping views.
On structure of bivariate spline space of lower degree over arbitrary triangulation
Authors: Zhongxuan Luo, Yu Liu, Lijuan Chen
Venue: Journal of Computational and Applied Mathematics (2008)

The structure of bivariate spline space over arbitrary triangulation is complicated because the dimension of a multivariate spline space depends not only on the topological property of the triangulation but also on its geometric property. A new vertex coding method to a triangulation is introduced in this paper to further study structure of the spline spaces. The upper bound of the dimension of spline spaces over triangulation given by L.L. Schumaker is slightly improved via the new vertex coding method. The structure of multivariate spline spaces S"2^1(@?) and S"3^1(@?) over arbitrary triangulation are studied via the method of smoothness cofactor and the structure matrix of multivariate spline ring by Luo and Wang. A kind of sufficient conditions on judging non-singularity of the S"2^1(@?) and S"3^1(@?) spaces over arbitrary triangulation is given, which only depends on the topological property of the triangulation. From the sufficient conditions, a triangulation strategy is presented at the end of the paper. The strategy ensures that the constructed triangulation is non-singular (or generic) for S"2^1 and S"3^1.
SIMPLE FUZZY GRID PARTITION FOR MINING MULTIPLE-LEVEL FUZZY SEQUENTIAL PATTERNS
Authors: Yi-Chung Hu
Venue: Cybernetics and Systems (2007)

Fuzzy sequential patterns are discovered by finding intertransaction fuzzy patterns among data items at a single level. In this paper, a fuzzy data mining method for finding fuzzy sequential patterns at multiple levels of abstraction is developed. Actually, a new method is proposed to mine multiple level fuzzy sequential patterns, using fuzzy partition by a simple fuzzy grid, among data items at a concept hierarchy. The proposed method is composed of two phases: one to find frequent level crossing fuzzy 1-sequences, and the other to generate multiple level fuzzy sequential patterns by analyzing the temporal relation between those frequent fuzzy 1-sequences. A numerical example along with a mining process is used to illustrate the usefulness of the proposed method.
The effect of granularity and order in XML element retrieval
Authors: Nils Pharo
Venue: Information Processing and Management: an International Journal (2008)

The article presents an analysis of the effect of granularity and order in an XML encoded collection of full text journal articles. Two-hundred and eighteen sessions of searchers performing simulated work tasks in the collection have been analysed. The results show that searchers prefer to use smaller sections of the article as their source of information. In interaction sessions during which articles are assessed, however, they are to a large degree evaluated as more important than the articles' sections and subsections.
A cooperative game theoretical replica placement technique
Authors: Samee Ullah Khan, Ishfaq Ahmad
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Creating replicas of frequently accessed data objects across a read intensive network can lead to reduced communication cost and end-user response time. On the contrary, data replication in the presence of writes incurs extra cost due to multiple updates. The selection of data objects and servers requires solving a constraint optimization problem, which is NP-complete in general. A majority of the current state-of-the-art replica placement techniques suffer from high computational complexity issues. To circumvent such issues, we propose a cooperative game theoretical technique in which the servers (players) in the system collectively deliberate to converge at a replica schema that is beneficial to the system as a whole. In particular we make use of the Aumann-Shapley mechanism of cooperative game theory to propose an effective replica placement technique that yields good solutions when the system is very heavily loaded. Experimental comparisons are made against: 1) branch and bound, 2) greedy, 3) genetic, 4) Dutch auction, and 5) English auction. As demonstrated by the experimental results, the proposed technique maintains superior solution quality in terms of lower communication cost and reduced execution time.
Absolute Quantification of Swine Brain Glutamate Compounds Concentration using MR Spectroscopy and LCModel after Nasal Spraying Butorphanol Tartrate
Authors: J. L. Wu, T. Liu, Y. Lin, Z. W. Shen, Y. W. Miao, R. H. Wu, Z. J. Lang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

The purpose of this study was to investigate whether the Central Nervous System (CNS) analgesics affect the metabolites of swine brain by nasal spraying. Single voxel proton magnetic resonance spectroscopy (1H-MRS) was performed on 9 swine. The data were post-processed using LCModel software. Before nasal spraying butorphanol tartrate, the mean Glutamate compounds (Glx) concentration was 9.276±0.542 mmol/kg. After nasal spraying, the mean Glx concentration was 7.283±0.540mmol/kg. Using paired sample t-test we found that swine brain Glx level was significantly decreased after using nasal spray analgesic (t=2.826, p=0.022). However, there were no significant differences concerning mean NAA concentrations and mean Choline (Cho) concentrations before and after nasal spraying. Before nasal spraying, the mean NAA and Cho concentrations were 6.094±0.384 mmol/kg and 1.547±0.114 mmol/kg, respectively. After nasal spraying, the mean NAA and Cho concentrations were 5.530±0.346mmol/kg and 1.255±0.079mmol/kg, respectively. Our results imply that Glx are nociceptive neurotransmitters and play an important role in the analgesia.
Lossless Compression of Hexahedral Meshes
Authors: Peter Lindstrom, Martin Isenburg
Venue: Proceedings of the Data Compression Conference (2008)

Many science and engineering applications use high-resolution unstructured hexahedral meshes to model solid 3D shapes for finite element simulations. These simulations frequently dump the mesh and associated fields to disk for subsequent analysis, which involves the transfer of huge volumes of data. To reduce requirements on disk space and bandwidth, we propose efficient schemes for lossless online compression of hexahedral mesh geometry and connectivity. Our approach is to use hash-based value predictors to transform the mesh connectivity list into a more compact byte-aligned stream of symbols that can then be efficiently compressed using conventional text compressors such as gzip. Our scheme is memory efficient, fast, and simple to implement, and yields 1-3 orders of magnitude reduction on a set of benchmark meshes. For geometry and field coding, we derive a set of local spectral predictors optimized for each possible configuration of previously encoded and thus available vertices within a hexahedron. Combined with lossless floating-point residual coding, this approach improves considerably upon prior predictive geometry coding schemes.