ppxscal/embedding_network huggingface dataset:
Bioinformatics Analysis of the Envelope Glycoprotein and Construction of Infectious RNA Transcripts of Dengue Virus
Authors: Hua Zhong, Shuji Gong, Wei Zhao, Lidan Chen, Hao Zhou, Liang Peng, Hong Cao
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

The efficient tetravalent vaccine is urgently needed to provide long-term and all-round immunity against dengue virus. In order to construct the tetravalent attenuated vaccine, the well defined B-cell and T-cell epitopes of the glycoprotein of the DEN-1 HAWAII strain were predicted and analyzed by using network servers. The long RT-PCR was established to amplify the cDNA of DEN-2 NGC strain for constructing infectious dengue virus clone.Furthermore, the infectious transcript technology was utilized, using cDNAs as templates, the viral RNA could be transcribed in vitro, and the experiment on its infectivity was carried out. Our results showed that the dengue virus -specific RNA fragment could be detected from infected mice brain and cells, and the virion could be observed. To lay a foundation for the development of the protective tetravalent vaccine, further studies are needed for the construction of a chimeric virus by using the B-and T-cell epitopes of the glycoprotein.
Inconsistent Fail due to Limited Tester Timing Accuracy
Authors: Intaik Park, Donghwi Lee, Erik Chmelar, Edward J. McCluskey
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Delay testing is a technique to determine if a chip will function correctly at a specified frequency. If a chip passes delay tests, it will presumably function at the specified frequency in the field. This paper presents experimental results that show how chips can pass very thorough delay tests and still fail in the field. It is shown that some chips sometimes pass and sometimes fail when the same delay test is applied multiple times under the same test conditions. These chips are called inconsistent fails. This paper shows how tester timing edge placement accuracy can cause inconsistent fails and suggests the minimum requirements for guardbands that avoid the inconsistent test results.
A 3-level information architecture for e-learning based on data warehousing
Authors: Sean W. M. Siqueira, Maria Helena L. B. Braz, Rubens N. Melo
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

Developing high quality learning content material is expensive and time-consuming. Nowadays, in order to reduce costs and development time, there is an emphasis on reuse. The approach of object orientation has been used for promoting reuse. When this approach is applied to the development of learning content, it results in learning objects. However, there isn't a well-accepted and used methodology for the development of such objects and usually the reuse is based on the multimedia files that are referenced through metadata. In this paper we describe three levels of information that should be considered when dealing with e-learning content. An analogy to Data Warehouse architectures is proposed. Our approach allows keeping the already existing LO repositories and their autonomy, while the semantics of the content is structured to be reused in a personalized way. In addition, the mature of Data Warehousing technologies enhances the implementation of the 3-level information architecture for e-learning, which leads to a richer scenario for content reuse. Finally, the Data Warehouse idea of navigating (i.e., exploring content) can also stimulate students to go further on the quest for knowledge. We present how existing standard proposals can be used through the three levels and describe a case study.
Universal symbolic execution and its application to likely data structure invariant generation
Authors: Yamini Kannan, Koushik Sen
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

Local data structure invariants are asserted over a bounded fragment of a data structure around a distinguished node M of the data structure. An example of such an invariant for a sorted doubly linked list is "for all nodes M of the list, if M ≠ null and M.next ≠ null, then M.next.prev = M and M.value ≤ M.next.value." It has been shown that such local invariants are both natural and sufficient for describing a large class of data structures. This paper explores a novel technique, called Krystal, to infer likely local data structure invariants using a variant of symbolic execution, called universal symbolic execution. Universal symbolic execution is like traditional symbolic execution except the fact that we create a fresh symbolic variable for every read of a lvalue that has no mapping in the symbolic state rather than creating a symbolic variable only for inputs. This helps universal symbolic execution to symbolically track data flow for all memory locations along an execution even if input values do not flow directly into those memory locations. We have implemented our algorithm and applied it to several data structure implementations in Java. Our experimental results show that we can infer many interesting local invariants for these data structures.
Design of mid-infrared InAs/GaSb superlattice detectors for room temperature operation
Authors: Y. Cuminal, J. B. Rodriguez, P. Christol
Venue: Finite Elements in Analysis and Design (2008)

This paper presents the simulation of mid-infrared InAs/GaSb superlattice (SL) detectors by using a finite element FEMLAB code, which is a practical and useful tool to characterize and to define microelectronic devices with appropriate geometry. In the framework of this FEMLAB code, the electro-optic performances of the SL photodetectors for room temperature (RT) operation are theoretical evaluated in terms of zero-bias resistance-area product R"0A and of external quantum efficiency @h in order to estimate the specific detectivity D^*. In the case of realistic SL active zone, calculated results show an optimal active zone thickness of about 1.3@mm and a RT specific detectivity D"@l^*=2x10^9cmW^-^1Hz^1^/^2 at @l=4@mm. This expected value demonstrates that InAs/GaSb SL detector is a competitive technology suitable for third generation detectors.
Cascadia: A System for Specifying, Detecting, and Managing RFID Events
Authors: Evan Welbourne, Nodira Khoussainova, Julie Letchner, Yang Li, Magdalena Balazinska, Gaetano Borriello, Dan Suciu
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

Cascadia is a system that provides RFID-based pervasive computing applications with an infrastructure for specifying, extracting and managing meaningful high-level events from raw RFID data. Cascadia provides three important services. First, it allows application developers and even users to specify events using either a declarative query language or an intuitive visual language based on direct manipulation. Second, it provides an API that facilitates the development of applications which rely on RFID-based events. Third, it automatically detects the specified events, forwards them to registered applications and stores them for later use (e.g., for historical queries). We present the design and implementation of Cascadia along with an evaluation that includes both a user study and measurements on traces collected in a building-wide RFID deployment. To demonstrate how Cascadia facilitates application development, we built a simple digital diary application in the form of a calendar that populates itself with RFID-based events. Cascadia copes with ambiguous RFID data and limitations in an RFID deployment by transforming RFID readings into probabilistic events. We show that this approach outperforms deterministic event detection techniques while avoiding the need to specify and train sophisticated models.
Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks
Authors: Chih-Kuang Lin, Vladimir Zadorozhny, Prashant Krishnamurthy
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

We introduce a distributed grid-based scheduling access scheme that mitigates high data loss in data intensive sensor networks. Our approach alleviates transmission collisions by applying virtual grids and adopting Latin Squares Characteristic to time slot assignments. We demonstrate that our technique efficiently handles sensor mobility with acceptable data loss and low overhead.
Curve-Skeleton Extraction Using Iterative Least Squares Optimization
Authors: Yu-Shuen Wang, Tong-Yee Lee
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

A curve skeleton is a compact representation of 3D objects and has numerous applications. It can be used to describe an object¡¦s geometry and topology. In this paper, we introduce a novel approach for computing curve skeletons for volumetric representations of the input models. Our algorithm consists of three major steps: 1) using iterative least squares optimization to shrink models and, at the same time, preserving their geometries and topologies; 2) extracting curve skeletons through the thinning algorithm; and 3) pruning unnecessary branches based on shrinking ratios. The proposed method is less sensitive to noise on the surface of models and can generate smoother skeletons. In addition, our shrinking algorithm requires little computation, since the optimization system can be factorized and stored in the pre-computational step. We demonstrate several extracted skeletons that help evaluate our algorithm. We also experimentally compare the proposed method with other well-known methods. Experimental results show advantages when using our method over other techniques.
Application of Tetrahedral Mesh Model Based on Neural Network in Solid Mineral Reserve Estimation
Authors: Junfang Gong, Xincai Wu, Xiuguo Liu, Shengwen Li
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Mineral reserve estimation involves large amounts of geological data, and the traditional manual computation method is a heavy and fussy work. Computing mineral reserve with 3D orebody modeling can increase the efficiency heavily of reserve estimation and management. On the basis of analyzing several 3D orebody modeling methods, this paper choose tetrahedral mesh model to construct orebody, and introduces a mineral reserve estimation method based on neural network. The main advantages of this technique are an according management for orebody boundary and inner grade distribution, as well as its precision. Therefore, this technique has an academic and practical value. Keywords: Tetrahedron, Reserve estimation, Orebody modeling, 3D
Performance of modified nearest feature line method in a 3-D face recognition system with increment numbers of objects
Authors: Lina Lina, Benyamin Kusumoputro
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

Authors have developed a novel method for achieving higher recognition capability of a 3-D face recognition system based on feature line method. This method, which is called Modified Nearest Feature Line, has used as a classifier and it is combined with our developed Subspace Karhunen-Loeve transformation method as a feature extraction system to build a 3-D face recognition system. In this paper, the authors evaluated and analyzed the performance of this Modified Nearest Feature Line method for recognizing 3-D face images with various numbers of objects. As recognition rate is usually decreases by increasing the number of objects to be recognized, the performance of M-NFL method, in its recognition rate, is evaluated and then compare with that of the conventional NFL method. Experimental results show that the use of various numbers of objects influenced the recognition rate of the both two system, however, the slope of the decrement value using M-NFL method is lower than NFL method. It is also shown that in every same number of objects to be recognized, M-NFL method always gave a high recognition rate than the NFL method, with up to 20% in recognition rate difference value.
Towards process-based composition of self-managing service-oriented systems
Authors: Min'an Tan, Yan Liu, Liming Zhu
Venue: Proceedings of the 2nd international workshop on Systems development in SOA environments (2008)

Loose coupling and preserving safe changes are two key criteria for composing self-managing services. Composition of adaptive control components with business services without interfering with the original service operations is complicated by the dynamic and highly distributed nature of service-oriented systems. Essentially, encapsulating control logic into abstract logical models enables a clear separation of concerns, with states and transitions indicating the logical control flow. The challenge is to seamlessly integrate these models with services and their host infrastructure as a unified self-managing environment. In this paper, we present an architectural solution towards process-based composition and coordination of self-managing services. This architecture framework leverages business process models to produce declarative and executable control models. We discuss the problem context and outline the research challenges of such an approach.
Quality scalability of soft shadow mapping
Authors: Michael Schwarz, Marc Stamminger
Venue: Proceedings of graphics interface 2008 (2008)

Recently, several soft shadow mapping algorithms have been introduced which extract micro-occluders from a shadow map and backproject them on the light source to approximately determine light visibility. To maintain real-time frame rates, these algorithms often have to resort to coarser levels of a multi-resolution shadow map representation which can lead to visible quality degradations. In particular, discontinuity artifacts can appear when having to use different shadow map levels across pixels. In this paper, we discuss several aspects of soft shadow quality. First, we motivate and propose a scheme that allows for varying soft shadow quality in screen-space in a visually smooth way and also for its adaptation based on local features like assigned importance. Second, we suggest a generalization of micropatches which yields a better occluder geometry approximation at coarser shadow map levels, thus helping to reduce occluder overestimation. Third, we introduce a new hybrid acceleration structure for pruning the search space of potential micro-occluders that enables employing finer shadow map levels and hence increasing quality. Finally, we address multisampled rendering and suggest a simple scheme for interpolating light visibility that only adds a negligible cost compared to single-sample rendering.
SilSketch: automated sketch-based editing of surface meshes
Authors: Johannes Zimmermann, Andrew Nealen, Marc Alexa
Venue: Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling (2007)

We introduce an over-sketching interface for feature-preserving surface mesh editing. The user sketches a stroke that is the suggested position of part of a silhouette of the displayed surface. The system then segments all image-space silhouettes of the projected surface, identifies among all silhouette segments the best matching part, derives vertices in the surface mesh corresponding to the silhouette part, selects a sub-region of the mesh to be modified, and feeds appropriately modified vertex positions together with the sub-mesh into a mesh deformation tool. The overall algorithm has been designed to enable interactive modification of the surface --- yielding a surface editing system that comes close to the experience of sketching 3D models on paper.
Anti-jamming timing channels for wireless networks
Authors: Wenyuan Xu, Wade Trappe, Yanyong Zhang
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

Wireless communication is susceptible to radio interference, which prevents the reception of communications. Although evasion strategies have been proposed, such strategies are costly or ineffective against broadband jammers. In this paper, we explore an alternative to evasion strategies that involves the establishment of a timing channel that exists in spite of the presence of jamming. The timing channel is built using failed packet reception times. We first show that it is possible to detect failed packet events inspite of jamming. We then explore single sender and multisender timing channel constructions that may be used to build a low-rate overlay link-layer. We discuss implementation issues that we have overcome in constructing such jamming-resistant timing channel, and present the results of validation efforts using the MICA2 platform. Finally, we examine additional error correction and authentication mechanisms that may be used to cope with adversaries that both jam and seek to corrupt our timing channel.
Finding short lattice vectors within mordell's inequality
Authors: Nicolas Gama, Phong Q. Nguyen
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

The celebrated Lenstra-Lenstra-Lovász lattice basis reduction algorithm (LLL) can naturally be viewed as an algorithmic version of Hermite's inequality on Hermite's constant. We present a polynomial-time blockwise reduction algorithm based on duality which can similarly be viewed as an algorithmic version of Mordell's inequality on Hermite's constant. This achieves a better and more natural approximation factor for the shortest vector problem than Schnorr's algorithm and its transference variant by Gama, Howgrave-Graham, Koy and Nguyen. Furthermore, we show that this approximation factor is essentially tight in the worst case.
Multi-Layered Networks for Visualizing the Interactions between Heterogeneous Proteins
Authors: Yu Chen, Guangyu Cui, Kyungsook Han
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Recent improvements in high-throughput proteomics technology have produced a large amount of protein interaction data. Due to the volume of data, a graphical representation of protein interactions has proven to be much easier to understand than a long list of interacting proteins. For the past years we have studied the interactions between virus proteins and host cell proteins, but most methods that are typically used for visualizing protein interactions are not appropriate for the interactions between proteins of different types. These methods are intended for the interactions between proteins of a same type, and do not distinguish the interactions between proteins of a same type from those of different types. Visualization of the interactions between different types of proteins (such as virus proteins and host cell proteins) requires a new graph layout algorithm. This paper discusses a new layout algorithm for visualizing the interactions between heterogeneous proteins, and its application to the interactions between virus proteins and human proteins.
Learning through ICT-enabled social networks
Authors: Liqiong Deng, Marshall Scott Poole
Venue: International Journal of Information Technology and Management (2008)

Utilising Information and Communication Technology (ICT) to build effective learning networks in organisations has received attention from both practitioners and researchers in recent years. Going beyond the limited focus on the structural characteristics of networks in prior research, this paper develops a theoretical model that specifies how the structural properties of network ties and the quality of interaction influence the occurrence of single- and double-loop learning within ICT-enabled social networks. It provides insights into how ICT can be utilised to bring people together and form a productive environment conducive to learning. The model is expected to have theoretical and practical implications for the development of ICT-enabled social networks for individual learning.
Exploring locking & partitioning for predictable shared caches on multi-cores
Authors: Vivy Suhendra, Tulika Mitra
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Multi-core architectures consisting of multiple processing cores on a chip have become increasingly prevalent. Synthesizing hard real-time applications onto these platforms is quite challenging, as the contention among the cores for various shared resources leads to inherent timing unpredictability. This paper proposes the use of shared cache in a predictable manner through a combination of locking and partitioning mechanisms. We explore possible design choices and evaluate their effects on the worst-case application performance. Our study reveals certain design principles that strongly dictate the performance of a predictable memory hierarchy.
The Game-Based Constructive Learning Environment to Increase English Vocabulary Acquisition: Implementing a Wireless Crossword Fan-Tan Game (WiCFG) as an Example
Authors: Chiu-Pin Lin, Shelley Shwu-Ching Young, Hui-Chun Hung
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

Advances of handheld devices such as a PDA afford learners to conduct synchronous discussions and individual ideas made in a group could be synthesized easily. To achieve effective group learning in the classroom, we proposed a PDA-based English vocabulary acquisition game entitled Wireless Crossword Fan-Tan Game (WiCFG) that facilitates English vocabulary building for constructive learning environment. A Cooperative-Competitive module is embedded into this sharing construction learning environment. It is our hope that the game will facilitate students’ learning motivation and have much fun.
A Trust Evaluation Method for Node Cooperation in Mobile Ad Hoc Networks
Authors: Kun Wang, Meng Wu, Subin Shen
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In Ad Hoc networks, node misbehaviors due to selfish or malicious reasons can significantly degrade the performance of ad hoc networks. Previously, we proposed a trust-based incentive model on a self-policing mechanism to make nodes evaluate the trust of their neighbor locally [1]. That approach can mitigate contamination by direct observation and the use of second-hand information available. However, one situation hasn’t been considered that the secondhand information can be spurious, which raises the questions of how to incorporate it in a safe way and whether to propagate it. In this study, we adopt a trust evaluation method with a trust scaling factor on that trust-based incentive model to relieve the influence of fake second-hand information on the accuracy of trust value. Performance by simulation reveals that in the case of existing malicious nodes, the enhanced trusted Dynamic Source Routing (ET-DSR) with proposed trust evaluation method performs better than T-DSR in terms of packet successful delivery ratio and mean number of packets dropped. Meanwhile, ET-DSR is more suitable for large scale networks than T-DSR due to the introduction of trust scaling factor.
SOA process decisions: new challenges in architectural knowledge modeling
Authors: Qing Gu, Patricia Lago
Venue: Proceedings of the 3rd international workshop on Sharing and reusing architectural knowledge (2008)

Architectural design decisions are commonly agreed as one of the main elements that constitute architectural knowledge. To avoid knowledge vaporization, architectural decisions and their rationale need to be documented in a systematic manner. Various works have been done on representing architectural knowledge. Process decisions are one type of design decisions that existing models have paid little attention to. In this paper, we specifically address process decisions in the SOA domain. In doing so, we challenge architectural knowledge representations by mapping two SOA process decisions against a core model of architectural knowledge. The result suggests that existing models need to be extended in order to model SOA process decisions.