ppxscal/embedding_network huggingface dataset:
Modelling Database Security through Agent-Based Simulation
Authors: Raymond Chiong, Sandeep Dhakal
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper presents an implementation on modelling the database security using agent-based simulation (ABS). While ABS has been widely used for social simulations since the 1990s, not many previous studies have tried simulating scenarios in more technical domains and it is the main objective of this work to fill in the gap. We develop a database security simulation program that includes permission rules and immediate fixing of corrupted data. We show that when privileges are selectively granted based on certain rules and regulations, database security can be dramatically improved. We also demonstrate that if corrupted data are fixed immediately, the database will not collapse. In the concluding remarks, we present our observation on the advantages of ABS.
Service Oriented Architecture: Making the Leap, Leveraging Model Driven Architecture and Achieving Software Agility with BPM, SOA and MDA®
Authors: Richard Soley, Andrew Watson
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

It seems that Service Oriented Architecture (SOA) is to be this year's hot buzzword, rather than a well defined, meaningful and valuable part of the Enterprise Architecture landscape. Before the term fades away completely, perhaps we should agree what's valuable about the move to SOA and how to make the leap, and make the leap valuable. The SOA Consortium is making great strides in defining SOA tobe a valuable business strategy for business agility, in the context of Enterprise Architecture, Business Process Management and otherconcepts; and the Object Management Group (OMG) is making headway on modeling standards for services (as opposed to yet another set of standards for moving bits around wires). Dr. Soley will introduce the SOA Consortium and give some context for OMG's work in service modeling, with a focus on early successes in implementing the SOA business strategy leveraging modeling technologies like UML, BPMN and MOF.
Increasing diversity in k-12 computer science: strategies from the field
Authors: Joanna Goode
Venue: ACM SIGCSE Bulletin (2008)

In this paper, I describe features of computer science programs which have successfully attracted underrepresented students to study CS. Drawing from my own teaching experiences, research, and teacher education work; I provide strategies which have diversified K-12 CS courses. The paper also points out how many of these features rely on committed partnerships between schools, school districts, universities, and the CS industry.
Active Blood Detection in a High Resolution Capsule Endoscopy using Color Spectrum Transformation
Authors: Yun Sub Jung, Young Ho Kim, Dong Ha Lee, Jong Hyo Kim
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Capsule Endoscopy(CE) is a new modality for convenient and accurate investigation of small bowel pathology including obscure gastrointestinal bleeding. In this paper, we present a method for automatic detection of the bleeding region for a new high performance CE system with a new feature index in CE. The CE transmits 3 images per second to the receiver for about 10 hours. Over 100,000 images are recorded to the receiver. Typically, viewing such a large amount of images gives clinicians a significant burden [3]. We propose a technique to detect the bleeding automatically, utilizing the color spectrum transformation method and morphological filtering. Also, we can decide bleeding sites effectively through continuous image detection.
An Approach for a Comprehensive QA Methodology for the PDKs
Authors: Sridhar Joshi, Ravi Perumal, Kamesh Gadepally, Mark Young
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Achieving First time Silicon is a necessity to meet the Organization’s bottom line. From the CAD perspective, ensuring quality in the collateral that is supplied to the designers plays a very crucial role in this objective. This paper attempts to capture the evolution of process of achieving high quality Process Design Kits (PDKs).
Enabling Pervasiveness by Seamless Inter-domain Handover: Performance Study of PANA Pre-authentication
Authors: Patryk Chamuczynski, Omar Alfandi, Henrik Brosenne, Constantin Werner, Dieter Hogrefe
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Pervasive wireless networking requires continuous connection to the Internet while moving from one administration domain to another. To enable continuous connection seamless handover has to be ensured. A concept to ensure seamless handover is the make-before-break approach which can be achieved by performing the pre-authentication in the new domain while maintaining connection to current domain. The duration of the authentication is critical for the handover process because if the mobile nodes move very fast the remaining amount of time of connection to the current domain can become very limited. Therefore, it is a vital issue for seamless mobility to study the authentication performance of a pre-authentication framework. In this paper we model an authentication infrastructure and consider a scenario in which a high number of nodes handover to a new administration domain. The simulation of the authentication process shows the relation between authentication performance and traffic intensity. Furthermore we identify some critical points and potential bottlenecks of this pre-authentication approach.
Analytic performance comparison of hypercubes and star graphs with implementation constraints
Authors: A. E. Kiasari, H. Sarbazi-Azad
Venue: Journal of Computer and System Sciences (2008)

Many theoretical-based comparison studies, relying on graph structural and algorithmic properties, have been conducted for the hypercube and the star graph. None of these studies, however, have considered real working conditions and implementation limits. We have compared the performance of the star and hypercube networks for different message lengths and number of virtual channels, and considered two implementation constraints, namely the constant bisection bandwidth and constant node pin-out. We use two accurate analytical models, already proposed for the star graph and hypercube, and implement the parameter changes imposed by technological implementation constraints. When no constraint is used, the comparison results reveal that the hypercube has a better performance compared to the equivalent star graph. The hypercube with more channels compared to its equivalent star graph saturates later showing that it can bear heavier traffic loads. However, when implementation constraints are considered, the star graph exhibits a superior performance over its equivalent hypercube in most cases.
VPFS: building a virtual private file system with a small trusted computing base
Authors: Carsten Weinhold, Hermann Härtig
Venue: Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008 (2008)

In this paper we present the lessons we learned when developing VPFS, a virtual private file system that is based on both a small amount of trusted storage and an untrusted legacy file system residing on the same machine. VPFS' purpose is to provide secure and reliable storage to highly sensitive applications running on top of a microkernel, which may concurrently execute untrusted software. The confidentiality and integrity guarantees of VPFS do not only apply to file contents, but also to all meta data including integrity of the directory structure. We explored design alternatives that allow us to securely reuse untrusted infrastructure and thereby minimize the complexity that a file-system implementation adds to the trusted computing base. VPFS is split into two isolated components. A small trusted component implements all security-critical functionality, whereas the untrusted part reuses an existing file-system implementation provided by a virtualized legacy operating system that can be untrusted. In our VPFS prototype, alternative configurations of the trusted component comprise only between 4,000 and 4,600 lines of code, which is at least an order of magnitude smaller than existing commodity file-system stacks.
Constructing Arden: Life Inside the Machine
Authors: Edward Castronova, Travis Ross, Mark Bell, Matthew Falk, Robert Cornell, Matt Haselton
Venue: IEEE MultiMedia (2008)

Virtual worlds have found many applications in gaming and training environments. Now, they are fulfilling their promise as alternative universes worthy of scientific study by serving as testbeds for experimentation in social science. In this article, Edward Castronova and his group at Indiana University discuss their Synthetic Worlds Initiative and Arden: The World of William Shakespeare.
Testing co-feature in cointegration system: the case of electricity consumption and economic growth in china
Authors: Yu Shun-Kun, Yuan Jia-Hai, Zhao Chang-Hong
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Co-integration techniques have be used in energy issue extensively. The study of shortrun dynamics in perspective of sepctral domain is another promising direction. However none study has cover the two directions together in energy study. In the paper, we investigate the vector error correction model considering co-feature. The identification procedure and algorithms are overviewed briefly in line with (Hecq. A., 2004). Then a simple case study for electricity consumption and economic growth in China is given for model comparison. It is found that model considering co-feature can potentially improve the model estimation efficiency. To our knowledge, although literature addressing energy and economic growth in cointegration theory is pouring in recently, there has been no study considering co-feature in the same time. So our paper can be seen as a first step in applying this kind of model in the field.
Performance Analysis of Dual Frame Motion Compensation
Authors: Da Liu, Xiangyang Ji, Debin Zhao, Xiaobin Zhu, Zhi Bian, Wen Gao
Venue: Proceedings of the Data Compression Conference (2008)

In dual frame video coding, one short-term reference frame (STR) and one long-term reference frame (LTR) are available for motion compensation. The STR is the previous frame of current frame. The LTR remains static for a few frames, and then jump forward. In this paper, for different GOP length and bits allocation of the LTR, the coding performance of dual frame motion compensation is analyzed. And during the video transmission over noisy channel, the error propagation of dual frame motion compensation is analyzed. Finally the analysis is proved by the experimental results.
Some notes on the characterization of compact sets of fuzzy sets with Lp metric
Authors: Congxin Wu, Zhitao Zhao
Venue: Fuzzy Sets and Systems (2008)

In 1990, Diamond gave a characterization of compact sets in the space of fuzzy star-shaped numbers with respect to the origin with L"p metric for 1=
Proteomic Approach to Screen Peanut Genotypes with Enhanced Nutritional Qualities
Authors: Ramesh Katam, Hemanth KN. Vasanthaiah, Sheikh M. Basha
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Peanut is an important food legume grown in semi-arid tropics of the world. Aspergillus fungus thrives in drought prevalent regions producing immunosuppressive carcinogenic aflatoxins in peanut seed. Identification and development of drought-tolerant genotype/s is the potential means to reduce aflatoxin contamination. We have determined differences in biochemical and molecular responses of peanut genotypes with varying degree of drought tolerance. Changes in protein and mRNA composition of seed in response to drought stress were measured using 2-Dimensional electrophoresis and Differential Display RT PCR. Mass spectroscopy analysis revealed down-regulation of methionine rich proteins (MRPs) and arachin proteins in drought-susceptible (DS) genotypes, while these proteins continue to express in drought-tolerant (DT) genotypes. Up-regulation of mRNA transcripts in DT genotypes indicated their association with stress tolerance. Continued expression of these proteins seems to enhance drought tolerance, reduce aflatoxin level and enhance nutritional value of peanut.
On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions
Authors: A. F. Izmailov, M. V. Solodov
Venue: Mathematical Programming: Series A and B (2008)

Assuming that the primal part of the sequence generated by a Newton-type (e.g., SQP) method applied to an equality-constrained problem converges to a solution where the constraints are degenerate, we investigate whether the dual part of the sequence is attracted by those Lagrange multipliers which satisfy second-order sufficient condition (SOSC) for optimality, or by those multipliers which violate it. This question is relevant at least for two reasons: one is speed of convergence of standard methods; the other is applicability of some recently proposed approaches for handling degenerate constraints. We show that for the class of damped Newton methods, convergence of the dual sequence to multipliers satisfying SOSC is unlikely to occur. We support our findings by numerical experiments. We also suggest a simple auxiliary procedure for computing multiplier estimates, which does not have this undesirable property. Finally, some consequences for the case of mixed equality and inequality constraints are discussed.
On cliques and bicliques
Authors: Michael A. Henning
Venue: Journal of Graph Theory (2000)

For integers m, n &ge; 2, let g(m, n) be the minimum order of a graph, where every vertex belongs to both a clique Km of order m and a biclique K(n, n). We show that g(m, n) = 2(m + n - 2) if m &le; n - 2. Furthermore, for m &ge; n - 1, we establish that $g(m, n) = \lceil (\sqrt{m - 1} + \sqrt{n - 1})^{2}\rceil $ if $\lceil \sqrt{(m - 1)(n - 1)}\rceil$ &equiv; 0 mod(n - 1) or, if m is sufficiently large and $\sqrt{(m - 1)(n - 1)}$ is not an integer. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 34: 60&ndash;66, 2000
Multi-hop buffering and adaptation for video-based sensor networking applications
Authors: Jie Huang, Wu-chi Feng, Wu-chang Feng, David Romano
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

As video sensor networks become more widely deployed, mechanisms for adaptively transmitting video data within the network are necessary because of their generally large resource requirements compared to their scalar counterparts. The key features of such networks include (i) many sources can inject video into the network that is destined for the same sink and (ii) nodes that participate in routing can also potentially work collaboratively for the benefit of the entire system. In this paper, we propose a multi-hop buffering and adaptation framework for video-based sensor networking applications. We explore several approaches in this framework and compare their performance with traditional IP-based video streaming technologies. Our experiments show that these approaches outperform traditional technologies in video quality, bandwidth waste, and bandwidth sharing fairness.
An Application of a Theorem of Johnstone and Forrester to Testing for Familial Aggregation
Authors: Yixin Fang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In family studies, genetic epidemiologists are interested in choosing traits, or combinations of traits, of high degree of familial aggregation to use in the linkage analysis. Principal components analysis of heritability, similar to canonical correlation analysis, estimates the linear combination with the largest heritability. However, the first and foremost task is to test if there is any trait, or combination of traits, of familial aggregation. To this aim, a type of permutation test is proposed. Since the permutation test is time-consuming, a theorem of Johnstoneand Forrester (2004) can be used to obtain the approximatep-value.
Decision Support Models for Personalized Course Composition with a Focus on Learning Styles
Authors: Ahmad Kardan, Nima Taghipour
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Various studies have indicated the value of customization and personalization in the context of e-learning systems and numerous efforts have been made in attempt to realize these goals. One significant research direction in this domain is finding effective methods for personalized course composition from a library of learning objects with respect to each learner's characteristics, goals and preferences. In this paper we employ decision support models for providing course compositions tailored to the specific characteristics of each individual learner, with an emphasis on the learning style of the learner. We show how these models can formally accommodate various features and preferences of the learner as well as how they can assist the learner in evaluating each solution by different criteria. We also propose methods for incorporating social behavior of the learners to the model in order to make use of other learners' experiences and provide higher levels of personalization for the target learner.
A High Performance Parallel IP Lookup Technique Based on Multiprocessor Organization and CREW PRAM
Authors: Mahmoud Hasanloo, Ali Amiri, Mahmood Fathy
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traffic and migration to IPv6 addresses. The IP routing lookup involves computation of the Longest Prefix Matching for which existing solutions, such as BSD Radix Tries, scale poorly when traffic in the router increases or when employed for IPv6 address lookups. In this paper, we describe a CREW PRAM multiprocessor organization lookup that uses P processor for solving LPM problem. By this technique P-1 IP addresses can be looked up simultaneously thus the performance of processors increase in linear manner. First we categorize all prefixes in some groups based on their first two bytes and sort them into their groups. By assuming M prefixes exist in a group then time complexity of insertion algorithm in worst case reduces to O(Log M + M/2) and the time complexity of search, update and deletion algorithms reduce to log(M) for each prefix.
Study on fuzzy optimization methods based on principal operation and inequity degree
Authors: Fa-Chao Li, Chen-Xia Jin
Venue: Computers Mathematics with Applications (2008)

Fuzzy optimization is a well-known optimization problem in artificial intelligence, manufacturing and management, so establishing general and operable fuzzy optimization methods are important in both theory and application. In this paper, by distinguishing principal indices and secondary indices, we give a method for comparing fuzzy information based on synthesizing effect and an operation for achieving fuzzy optimization based on a principal indices transformation. Further, we propose an axiomatic system for fuzzy inequity degree based on the essence of constraint, and give an instructive metric method for fuzzy inequity degree. Then, by combining with genetic algorithm, we give some fuzzy optimization methods based on principal operation and inequity degree (denoted by BPO&ID-FGA, for short). Finally, we consider the convergence of our algorithm using the theory of Markov chains and analyze its performance through two concrete examples. All these indicate that BPO&ID-FGA can effectively merge decision preferences into the optimization process and that it also possesses better global convergence, so it can be applied to many fuzzy optimization problems.
Natural language interface for information management on mobile devices
Authors: L. Zhou
Venue: Behaviour & Information Technology (2007)

A natural language interface (NLI) enables the ease-of-use of information systems in performing sophisticated human - computer interaction. To address the challenges of mobile devices to user interaction in information management, we propose an NLI as a promising solution. In this paper, we review state-of-the-art NLI technologies and analyse user requirements for managing notable information on mobile devices. To minimize any technical difficulties arising from developing and improving the usability of NLI systems we develop general principles for NLI design, which fills in a gap in the literature. In order to satisfy user requirements for information management on mobile devices, we innovatively design NLI-enabled information management architecture. It is shown from two usage scenarios that the architecture could lead to reduced effort in user navigation and improved efficiency and effectiveness of managing information on mobile devices. We conclude the article with the implications of this study and suggestions for future direction.
An ontology-driven software architecture evaluation method
Authors: Aida Erfanian, Fereidoun Shams Aliee
Venue: Proceedings of the 3rd international workshop on Sharing and reusing architectural knowledge (2008)

Software architecture evaluation has a crucial role in the life cycle of software intensive systems. In this paper we propose an approach to empower a software architecture evaluation method called the Architecture tradeoff Analysis Method (ATAM). Our approach is highly focused on the effective reusability of software architecture knowledge. We propose two ontologies focusing on the role of Attribute-Based Architectural styles (ABAS) in software architecture development and analysis. We show the effectiveness of our approach by presenting three case studies.
Homotopy perturbation method for solving hyperbolic partial differential equations
Authors: J. Biazar, H. Ghazvini
Venue: Computers Mathematics with Applications (2008)

This paper applies the homotopy perturbation method proposed by Ji-Huan He, to obtain approximate analytic solutions of hyperbolic partial differential equations. The procedure of the method is systematically illustrated. To give an extensive account of the method some examples are provided. The results derived by this method will be compared with the results of characteristics method. The results of homotopy perturbation method are of high accuracy, verifying that the method is very effective and promising.