ppxscal/embedding_network huggingface dataset:
Low-cost data communication network for rural telecom network management
Authors: C. Jagadish, Vinod Kumar Jammula, Timothy A. Gonsalves
Venue: International Journal of Network Management (2008)

The backbone networking infrastructure of rural telecom networks is often costly and is of limited bandwidth. The availability of connectivity such as DSL or leased lines is scarce. In order to keep operational costs low, these rural telecom networks are often kept unmanned and are managed from a centralized network management station (NMS). This often requires a low-cost, efficient and reliable data communication network (DCN) between the rural telecom equipment and the central NMS. The conventional DCN used for telecom management consists either of leased lines or Internet connectivity. These are often costly and not freely available in rural areas. We have developed a new DCN model, based on dial-up, which is easily available. Using mathematical models and measurements we show that this DCN meets the QoS requirements of a telecom network at an affordable cost. We have implemented this DCN in corDECT networks. This is in use in India and Tunisia, and is under implementation in other similar countries.
Design and implementation of the management agent for mobile devices based on OMA DM
Authors: Jaeyoung Shin, Youngwoo Chung, Kwang Sun Ko, Young Ik Eom
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

With the rapid advancement of mobile communication technologies, mobile devices are evolving into convergence devices with various multimedia capabilities. However, the needs for high-performance devices demand complicated settings, and thus contain latent error possibilities. Also, in these devices, poor system performance can be caused by the collisions of different software programs. In solving these problems, device management becomes an important issue. Open Mobile Alliance developed OMA DM(Device Management) which is a device management standard, and recently has released OMA DM v1.2, which provides improved mobile device management methods compared to earlier versions. OMA DM v1.2 supports TNDS(Tree and Description Serialization) of XML or WBXML management trees. This paper introduces design and implementation of OMA DM v1.2 based MDM(Mobile Device Management) agent. By using TNDS which is supported by OMA DM v1.2 for acquiring, adding, and editing management objects in the mobile devices, it provides more effective device management functions with small amount of network traffic.
Software Rejuvenation and Reconfiguration for Enhancing Survivability of Sensor Networks
Authors: Dong Seong Kim, Sazia Parvin, Jong Sou Park
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

It is important to provide survivability of sensor networks in face of attacks in the network. In this paper, we focus on survivability modeling and enhancing of sensor networks through software rejuvenation and reconfiguration of sensor nodes in a cluster in the network. A specific action in software rejuvenation and reconfiguration is enforced to sensor node and it is possible to enhance survivability of sensor networks. We present a conceptual two level survivability model. The lower level presents how to define the state of each cluster in the network through a threshold function. The upper level presents probabilistic survivability of each cluster. We analyze proposed survivability model using proof of concept scenario examples and steady state analysis.
Peer Assessment of Group-Based Software Engineering Projects
Authors: David Hemer
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Group-based software engineering projects are an important part of Computer Science and Information Technology curricula. Fair assessment of individual contributions to group-based projects remains a challenging problem. Peer-based assessment, where students assess their fellow team members, is seen as one answer to this. In this paper we discuss the key aspects that need to be addressed in order to develop a successful peer assessment method. We propose a method for carrying out peer assessments for a large software engineering class. We briefly describe a web-based tool that we have developed to support our method, and comment on our initial experiences in using the tool.
Semantic model-driven development of web service architectures
Authors: Claus Pahl
Venue: International Journal of Web Engineering and Technology (2008)

Building service-based architectures has become a major area of interest since the advent of web services. Modelling these architectures is a central activity. Model-driven development is a recent approach to developing software systems based on the idea of making models the central artefacts for design representation, analysis and code generation. We propose an ontology-based engineering methodology for semantic model-driven composition and transformation of web service architectures. Ontology technology as a logic-based knowledge representation and reasoning framework can provide answers to the needs of sharable and reusable semantic models and descriptions needed for service engineering. Based on modelling, composition and code generation techniques for service architectures, our approach provides a methodological framework for ontology-based semantic service architecture.
A novel source/drain on void (SDOV) MOSFET implemented by local co-implantation of hydrogen and helium
Authors: Dake Wu, Ru Huang, Weihai Bu, Falong Zhou, Yu Tian, Baoqin Chen, Chuguang Feng, Mansun Chan, Yangyuan Wang
Venue: Microelectronic Engineering (2008)

In this paper a novel device named as SDOV MOSFET is proposed for the first time. This structure features localized void layers under the source and drain regions. The short channel effects of this device can be improved due to the SOI-like source/drain structure. In addition, without the dielectric layer under the channel region, this device can avoid some weaknesses of UTB SOI devices caused by the thin silicon film and the underlying buried oxide, such as mobility degradation, film thickness fluctuation and self-heating effect. Based on self-aligned hydrogen and helium co-implantation technology, the new device can be fabricated by a process compatible with the standard CMOS process. The SDOV MOSFETs with 50nm gate length are experimentally demonstrated for verification.
Efficient Selection of Observation Points for Functional Tests
Authors: Jian Kang, Sharad C. Seth, Yi-Shing Chang, Vijay Gangaram
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

The fault coverage of existing functional tests can be enhanced by additional observation points. For a given set of functional tests, this paper proposes an efficient fault-dropping fault simulation method for selecting a subset of observation points at a small fraction of the cost of non-fault-dropping fault simulation. Experimental results on industrial circuits demonstrate the effectiveness of the method in achieving close to optimal results in the size of the selected subset with an order of magnitude less time, without losing achievable coverage. The technique is particularly applicable to industrial designs where fault-simulation times can be prohibitively expensive, even when only a sample of faults is simulated using distributed techniques.
A Web Metering Scheme for Fair Advertisement Transactions
Authors: Ren-Chiun Wang, Wen-Shenq Juang, Chin-Laung Lei
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Since the rapid development of the Internet, many advertisers would want to introduce their goods on web sites. For achieving fair network advertisement payment, a payment system may need to evaluate the number of visited clients for particular web pages. However, advertisers fear that web servers inflate the number of metering. Also, web servers fear to receive a forged witness from a client. If one of the above situations happened, the payment of network advertisement is unfair. In this paper, we propose a user-efficient and fair web metering scheme for ubiquitous environments, where clients can use various intelligent devices to obtain their desired services at any time and any place.
Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic ε∈{-1,-2,-3}
Authors: Rong Luo, Yue Zhao
Venue: Journal of Combinatorial Theory Series B (2008)

In this paper, we consider the problem of determining the maximum of the set of maximum degrees of class two graphs that can be embedded in a surface. For each surface @S, we define @D(@S)=max{@D(G)|G is a class two graph of maximum degree @D that can be embedded in @S}. Hence Vizing's Planar Graph Conjecture can be restated as @D(@S)=5 if @S is a plane. We show that @D(@S)=7 if @e(@S)=-1 and @D(@S)=8 if @e(@S)@?{-2,-3}.
Taylor Series in Control Theory
Authors: Michal Kraus, Jirí Kunovský, Milan Pindryc, Václav átek
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

An original mathematical method which uses the Taylor series method for solving differential equations in a non-traditional way has been developed. Experimental calculations have shown and theoretical analyses have verified that the accuracy and stability of the Taylor series method exceeds the currently used algorithms for numerically solving differential equations. It is the aim of the paper to adapt Taylor series to real-time simulation. A special hardware for model representation is presented, too.
Tiling a polygon with rectangles
Authors: C. Kenyon
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles). They present a linear time algorithm for deciding if a polygon can be tiled with 1 * m and k * 1 tiles (and giving a tiling when it exists), and a quadratic algorithm for the same problem when the tile types are m * k and k * m.
Applying Dataflow Analysis to Dimension Buffers for Guaranteed Performance in Networks on Chip
Authors: Andreas Hansson, Maarten Wiggers, Arno Moonen, Kees Goossens, Marco Bekooij
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

A Network on Chip (NoC) with end-to-end flow control is modelled by a cyclo-static dataflow graph. Using the proposed model together with state-of-the-art dataflow analysis algorithms, we size the buffers in the network interfaces. We show, for a range of NoC designs, that buffer sizes are determined with a run time comparable to existing analytical methods, and results comparable to exhaustive simulation.
A single-pass GPU ray casting framework for interactive out-of-core rendering of massive volumetric datasets
Authors: Enrico Gobbetti, Fabio Marton, Jos&#x00e9; Antonio Iglesias Guiti&#x00e1;n
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

We present an adaptive out-of-core technique for rendering massive scalar volumes employing single-pass GPU ray casting. The method is based on the decomposition of a volumetric dataset into small cubical bricks, which are then organized into an octree structure maintained out-of-core. The octree contains the original data at the leaves, and a filtered representation of children at inner nodes. At runtime an adaptive loader, executing on the CPU, updates a view and transfer function-dependent working set of bricks maintained on GPU memory by asynchronously fetching data from the out-of-core octree representation. At each frame, a compact indexing structure, which spatially organizes the current working set into an octree hierarchy, is encoded in a small texture. This data structure is then exploited by an efficient stackless ray casting algorithm, which computes the volume rendering integral by visiting non-empty bricks in front-to-back order and adapting sampling density to brick resolution. Block visibility information is fed back to the loader to avoid refinement and data loading of occluded zones. The resulting method is able to interactively explore multi-gigavoxel datasets on a desktop PC.
The Scheuble Apparatus
Authors: Herbert Paulis
Venue: Cryptologia (2007)

During World War I, on the front between the Austro-Hungarian Empire and the Kingdom of Italy, weak codes and ciphers and their usage greatly aided Austrian intelligence in breaking the most secret Italian messages. As an aid some ingenious mechanical devices were constructed which assisted the Austrian codebreakers in their work. Few rare and precious exemplars still exist in a museum and those are described and analyzed and shown in various figures within this article.
Non-negative matrix factorization with α-divergence
Authors: Andrzej Cichocki, Hyekyoung Lee, Yong-Deok Kim, Seungjin Choi
Venue: Pattern Recognition Letters (2008)

Non-negative matrix factorization (NMF) is a popular technique for pattern recognition, data analysis, and dimensionality reduction, the goal of which is to decompose non-negative data matrix X into a product of basis matrix A and encoding variable matrix S with both A and S allowed to have only non-negative elements. In this paper, we consider Amari's @a-divergence as a discrepancy measure and rigorously derive a multiplicative updating algorithm (proposed in our recent work) which iteratively minimizes the @a-divergence between X and AS. We analyze and prove the monotonic convergence of the algorithm using auxiliary functions. In addition, we show that the same algorithm can be also derived using Karush-Kuhn-Tucker (KKT) conditions as well as the projected gradient. We provide two empirical study for image denoising and EEG classification, showing the interesting and useful behavior of the algorithm in cases where different values of @a (@a=0.5,1,2) are used.
Annotation of Enterprise Models for Interoperability Purposes
Authors: Nacer Boudjlida, Hervé Panetto
Venue: Proceedings of the 2008 International Workshop on Advanced Information Systems for Enterprises (2008)

The purpose of annotations is to describe the content of “something” and they may be considered as meta-data. They are used for a while for text books, articles, hypertext documents and so on. We explore their usage in semantic-based and model-based interoperability, with the aim to make explicit the meaning and the structure of given models (artefacts) to enable not only their understanding, but also their exchange (and their possible transformation) between collaborating actors (human or machine). We propose categories and types of annotations helpful to explicit the deep meaning of models and to ease their exchange.
Developing a SSE-CMM-based security risk assessment process for patient-centered healthcare systems
Authors: LiGuo Huang, Xu Bai, Suku Nair
Venue: Proceedings of the 6th international workshop on Software quality (2008)

Information security and privacy are the major concerns in healthcare domain. However, there lacks a comprehensive framework for evaluating the security engineering practices for healthcare systems. Current transition from institution-centered to patient-centered healthcare introduces additional security and privacy problems. With the intensive human (especially the patient) interaction involved in the patient-centered health care systems, information security and privacy can be assured not only by technologies and infrastructure but also by process. This paper develops a mapping from SSE-CMM process areas to the patient-centered healthcare domain aiming at establishing a set of metrics to assess security risks for patient-centered healthcare systems. Based on the mapping, a security risk assessment process is then proposed to evaluate the PHR system (a typical patient-centered healthcare system).
Foot/Ankle Roll-Over Characteristics for Different Joint Alignments of the Ankle-Foot Orthosis( AFO) during Level Walking
Authors: Hueseok Choi, Youngho Kim
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

This study investigated foot/ankle roll-over characteristics for different joint alignments of the ankle-foot orthosis(AFO). Seven volunteers without any musculoskeletal or foot problems participated in motion analyses. To obtain roll-over shape of the ankle-foot complex, we used trajectories of ankle and knee joints and the center of pressure(COP) between initial contact(IC) and opposite initial contact(OIC). After the roll-over shape was determined for each data, it was represented by a circular arc using the least-square method. Results showed that for the more dorsiflexed AFOs, the more distally the roll-over trajectory moved at initial contact. Also, we found that the radius of curvature significantly increased and the center of roll-over shape moved posteriorly and superiorly in dorsiflexed AFOs. Present results might provide a better understanding for the proper alignment of the orthotics as well as a single roll-over shape during walking.
Persistence in the Enterprise: A Guide to Persistence Technologies (The developerWorks Series), 1 edition
Authors: Geoffrey Hambrick, Kyle Brown, Roland Barcia, Robert Peterson, Kulvir S. Bhogal
Venue:  (2008)

The Definitive Guide to Todays Leading Persistence Technologies Persistence in the Enterprise is a unique, up-to-date, and objective guide to building the persistence layers of enterprise applications. Drawing on their extensive experience, five leading IBM Web development experts carefully review the issues and tradeoffs associated with persistence in large-scale, business-critical applications. The authors offer a pragmatic, consistent comparison of each leading framework--both proprietary and open source. Writing for IT managers, architects, administrators, developers, and testers, the authors address a broad spectrum of issues, ranging from coding complexity and flexibility to scalability and licensing. In addition, they demonstrate each framework side by side, via a common example application. With their guidance, youll learn how to define your persistence requirements, choose the most appropriate solutions, and build systems that maximize both performance and value. Coverage includes Taking an end-to-end application architecture view of persistenceUnderstanding business drivers, IT requirements, and implementation issuesDriving your persistence architecture via functional, nonfunctional, and domain requirementsModeling persistence domainsMapping domain models to relational databasesBuilding a yardstick for comparing persistence frameworks and APIsSelecting the right persistence technologies for your applicationsComparing JDBC, Apache iBATIS, Hibernate Core, Apache OpenJPA, and pureQuery The companion web site includes sample code that implements the common example used throughout the technology evaluation chapters, 5-9. The IBM Press developerWorks Series is a unique undertaking in which print books and the Web are mutually supportive. The publications in this series are complemented by resources on the developerWorks Web site on ibm.com. Icons throughout the book alert the reader to these valuable resources.
Combinatorial and statistical methods for part selection for object recognition
Authors: Zhipeng Zhao, Akshay Vashist, Ahmed Elgammal, Ilya Muchnik, Casimir Kulikowski
Venue: International Journal of Computer Mathematics (2007)

In object recognition tasks, where images are represented as constellations of image patches, often many patches correspond to the cluttered background. In this paper, we present a two-stage method for selecting the image patches which characterize the target object class and are capable of discriminating between the positive images containing the target objects and the complementary negative images. The first stage uses a combinatorial optimization formulation on a weighted multipartite graph. The following stage is a statistical method for selecting discriminative patches from the positive images. Another contribution of this paper is the part-based probabilistic method for object recognition, which uses a common reference frame instead of reference patch to avoid possible occlusion problems. We also explore different feature representation using principal component analysis (PCA) and 2D PCA. The experiment demonstrates our approach has outperformed most of the other known methods on a popular benchmark dataset while approaching the best known results.
Future Standards for Immersive VR: Report on the IEEE Virtual Reality 2007 Workshop
Authors: Nicholas F. Polys, Don Brutzman, Anthony Steed, Johannes Behr
Venue: IEEE Computer Graphics and Applications (2008)

The Future Standards for Immersive VR Workshop at the IEEE Virtual Reality 2007 Conference aimed to foster an understanding between the VR and Web3D communities. Through multiple tool and application examples, contributors looked at the challenges and requirements for next-generation standards, comparing workflows among communities and developing a roadmap of reciprocal education and effort.
Bidimensional Empirical Mode Decomposition for the fusion of multispectral and panchromatic images
Authors: Z. Liu, P. Song, J. Zhang, J. Wang
Venue: International Journal of Remote Sensing (2007)

Currently available image fusion techniques applied to the merging of fine resolution panchromatic and multispectral images are still not able to minimize colour distortion and maximize spatial detail. In this study, a new fusion method, based on Bidimensional Empirical Mode Decomposition (BEMD), is proposed. Unlike other multiresolution analysis tools, such as the discrete wavelet transform (DWT), which normally examines only horizontal, vertical and diagonal orthonormal details at each decomposed scale, the BEMD produces a fully two-dimensional decomposition of the panchromatic and multispectral images, based purely on spatial relationships between the extrema of the image. These are decomposed into a certain level of Intrinsic Mode Functions (IMFs) and residual images with the same number of columns and rows as the original image. In consequence, by injecting all the IMF images from the panchromatic image into the residue of the corresponding multispectral image, the fusion image may be reconstructed. The fusion results are evaluated and compared with other popular methods in terms of both the visual examination and the quantitative assessment of the merged images. Preliminary results show that BEMD is optimal and provides a delicate balance between spectral information preservation and enhancement of spatial detail.
Multi-level scheduling for global optimization in grid computing
Authors: Chunlin Li, Layuan Li
Venue: Computers and Electrical Engineering (2008)

The paper presents a multi-level scheduling algorithm for global optimization in grid computing. This algorithm provides a global optimization through a cross-layer optimization realized by decomposing the optimization problem in different sub-problems each of them corresponding to one among the grid layers such as application layer, collective layer and fabric layer. The QoS of an abstraction level is a utility function that assigns at every level a different value and that depends on the kind of task that is executed on the grid. The global QoS is given by processing of the utility function values of the three different levels, using the Lagrangian method. Multi-level QoS scheduling algorithm is evaluated in terms of system efficiency and their economic efficiency, respectively. Economic efficiency includes user utility, service provider's revenue and grid global utility. System efficiency includes execution success ratio and resource allocation ratio.