ppxscal/embedding_network huggingface dataset:
Generalized rate monotonic schedulability bounds using relative period ratios
Authors: Hsin-Wen Wei, Kwei-Jay Lin, Wan-Chen Lu, Wei-Kuan Shih
Venue: Information Processing Letters (2008)

One of the most well-studied scheduling algorithms for real-time systems is the Rate Monotonic (RM) scheduling for periodic tasks. In this paper we derive a generalized RM schedulability bound by considering relative period ratios among tasks in a system. We show that schedulability bounds published earlier are special cases of our generalized bound. Our new bound may provide a higher value than earlier results.
Cost efficiency analysis with ordinal data: a theoretical and computational view
Authors: G. R. Jahanshahloo, M. Soleimani-Damaneh, A. Mostafaee
Venue: International Journal of Computer Mathematics (2007)

Standard Data Envelopment Analysis models obtain the cost efficiency of units when the data are known exactly, but these models fail to evaluate the units in the presence of ordinal data. Therefore, this paper provides models for the treatment of ordinal data in cost efficiency analysis. The models have multiplier forms with additional weight restrictions. The main idea in constructing these models is based on the weighted enumeration of the number of inputs/outputs of each unit which are categorized on the same scale rate. Some techniques to reduce the complexity of the models are introduced.
The Analysis of Chemotherapy Resistance in Human Non-small Cell Lung Cancer Cell Line with an Integrated Microfluidic Device
Authors: Siyan Wang, Lichuan Zhang, Li Jiang, Bingcheng Lin, Qi Wang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Microchip-based systems have many desirable characteristics and can be used in much cellular biological analysis. This work studied the correlation between the expression of Glucose-regulated protein-78 (GRP78) and anticancer drug VP-16 in human non-small cell lung cancer cell line SK-MES-1 using an integrated microfluidic device. A concentration gradient of stimulator (A23187) was generated in the upstream network of the device to induce the cells cultured in the downstream. Then the cells were treated by VP-16. The expression of GRP78 was detected by immunofluorescence. Apoptosis was assessed morphologically by 4’-6-Diamidino-2-phenylindol nuclear staining for the cells treated by VP-16. The expressions of GRP78 for the A23187-induced cells increased. After the treatment by VP-16, the percentage of apoptotic cells decreased with the increasing of A23187 concentration. GRP78 plays an important role in the resistance to VP-16 in SK-MES-1. This system offers a unique platform to characterize cellular responses in a high-throughput fashion.
User-centered design of a mobile application for sharing life memories
Authors: Thomas Olsson, Marika Lehtonen, Dana Pavel, Kaisa Väänänen-Vainio-Mattila
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

People have an inherent need to capture and collect life memories such as moments with children or special events with friends. Capturing life memories is either spontaneous or planned. Memories are stored and frequently shared with other people. New internet services allow online sharing of photographs but they bypass the mobile aspect in capturing and sharing multimedia. In this paper, we present a concept mobile application for capturing and sharing memories while mobile and the user research studies that supported its design. Our aim was to design a prototype application that would enable mobile users to capture and share precious moments. Various categorizations of user behaviors related to personal media management emerged out of our user needs studies. We then followed a user-centered design process according to Contextual Design. The user evaluation of the resulted paper prototype showed that users appreciate the event based, instant sharing within particular groups of people.
Learning valued preference structures for solving classification problems
Authors: Eyke Hüllermeier, Klaus Brinker
Venue: Fuzzy Sets and Systems (2008)

This paper introduces a new approach to classification which combines pairwise decomposition techniques with ideas and tools from fuzzy preference modeling. More specifically, our approach first decomposes a polychotomous classification problem involving m classes into an ensemble of binary problems, one for each ordered pair of classes. The corresponding classifiers are trained on the relevant subsets of the (transformed) original training data. In the classification phase, a new query is submitted to every binary learner. The output of each classifier is interpreted as a fuzzy degree of preference for the first in comparison with the second class. By combining the outputs of all classifiers, one thus obtains a fuzzy preference relation which is taken as a point of departure for the final classification decision. This way, the problem of classification is effectively reduced to a problem of decision making based on a fuzzy preference relation. Corresponding techniques, which have been investigated quite intensively in the field of fuzzy set theory, hence become amenable to the task of classification. In particular, by decomposing a preference relation into a strict preference, an indifference, and an incomparability relation, this approach allows one to quantify different types of uncertainty in classification and thereby supports sophisticated classification and postprocessing strategies.
The number of vertices of degree k in a minimally k-edge-connected digraph
Authors: Yuan Xu-dong, Kang Liying, Cai Mao-cheng
Venue: Journal of Graph Theory (2000)

Let k be a positive integer, and D = (V(D), E(D)) be a minimally k-edge-connected simple digraph. We denote the outdegree and indegree of x &epsilon; V(D) by &delta;D(x) and &rho;D(x), respectively. Let u+(D) denote the number of vertices x in D with &delta;D(x) = k, &rho;D(x) > k; u&plusmn;(D) the number of vertices x with &delta;D(x) = &rho;D(x) = k; u- (D) the number of vertices x with &delta;D(x) > k, &rho;D(x) = k. W. Mader asked the following question in [Mader, in Paul Erd&ouml;s is Eighty, Keszthely, Budapest, 1996]: for each k &ge; 4, is there a ck > 0 such that u+(D) + 2u&plusmn;(D) + u-(D) &ge; ck|D| holds? where |D| denotes the number of the vertices of D. In this article, we give a partial result for the question. It is proved that, for |D| &ge; 2k - 2, $$u^{+}(D) + 2u^\pm(D)+u^-(D) \ge \cases{{2\left[D\right] \over 3k+2} + {4k^2+4 \over 3k+2} {\ \ \ \ {\rm for}\ k\ \ge 6},\cr\cr {\left[D\right] + 24 \over 7}{\indent\indent \ {\rm for}\ k\ = 4,}\cr\cr {2\left[D\right] + 80 \over 17}{\indent\indent {\rm for}\ k\ = 5.}}$$ &copy; 2000 John Wiley Sons, Inc. J Graph Theory 33: 94108, 2000
Reconstruction of heat transfer coefficients using the boundary element method
Authors: T. T. M. Onyango, D. B. Ingham, D. Lesnic
Venue: Computers Mathematics with Applications (2008)

This paper describes the reconstruction of the heat transfer coefficient (space, Problem I, or time dependent, Problem II) in one-dimensional transient inverse heat conduction problems from surface temperature or average temperature measurements. Since the inverse problem posed does not involve internal temperature measurements, this means that non-destructive testing of materials can be performed. In the formulation, convective boundary conditions relate the boundary temperature to the heat flux. Numerical results obtained using the boundary element method are presented and discussed.
Beyond the Model of Persistent TCP Flows: Open-Loop vs Closed-Loop Arrivals of Non-persistent Flows
Authors: Ravi S. Prasad, Constantine Dovrolis
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

It is common for simulation and analytical studies to model Internet traffic as an aggregation of mostly persistent TCP flows. In practice, however, flows follow a heavy-tailed size distribution and their number fluctuates significantly with time. One important issue that has been largely ignored is whether such non-persistent flows arrive in the network in an open-loop (say Poisson) or closed-loop (interactive) manner. This paper focuses on the differences that the TCP flow arrival process introduces in the generated aggregate traffic. We first review the Processor Sharing models for such flow arrival processes as well as the corresponding TCP packet-level models. Then, we focus on the queueing performance that results from each model, and show that the closed-loop model produces lower loss rate and queueing delays than the open-loop model. We explain this difference in terms of the increased traffic variability that the open-loop model produces. The cause of the latter is that the flow arrival rate in the open-loop model does not reduce upon congestion. We also study the transient effect ofcongestion events on the two models and show that the closed-loop model results in congestion-responsive traffic while the open-loop model does not. Finally, we discuss implications of the differences between the two models in several networking problems.
Scan chain clustering for test power reduction
Authors: Melanie Elm, Hans-Joachim Wunderlich, Michael E. Imhof, Christian G. Zoellin, Jens Leenstra, Nicolas Maeding
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

An effective technique to save power during scan based test is to switch off unused scan chains. The results obtained with this method strongly depend on the mapping of scan flip-flops into scan chains, which determines how many chains can be deactivated per pattern. In this paper, a new method to cluster flip-flops into scan chains is presented, which minimizes the power consumption during test. It is not dependent on a test set and can improve the performance of any test power reduction technique consequently. The approach does not specify any ordering inside the chains and fits seamlessly to any standard tool for scan chain integration. The application of known test power reduction techniques to the optimized scan chain configurations shows significant improvements for large industrial circuits.
Affine conjugate adaptive Newton methods for nonlinear elastomechanics
Authors: Martin Weiser, Peter Deuflhard, Bodo Erdmann
Venue: Optimization Methods Software (2007)

The paper extends affine conjugate Newton methods from convex to nonconvex minimization, with particular emphasis on PDE problems originating from compressible hyperelasticity. On the basis of well-known schemes from finite dimensional nonlinear optimization, three different algorithmic variants are worked out in a function space setting, which permits an adaptive multilevel finite element implementation. These algorithms are tested on two well-known 3D test problems and a real-life example from surgical operation planning.
Study on Supplier Selection Based on AHP and BP Neural Network
Authors: Bin Xia, Bin Pan
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

In accordance with the issue that the selection of suppliers lacks supporting theory, this paper mainly adopts Analytic Hierarchy Process to determine the best supplier, thus the management decision-making is going to be more scientific. In the meanwhile, through quantification calculation of the five indexes of suppliers selection and appraisal, which are the supplier's quality, the supplying situation, the communication and service, the transaction cost and arrear permission sum, as well as the Uniform Examination by using the BP neural network, the insufficiently objective problem of the AHP has been made up scientifically, and the decision-making is more scientific and credible.
Running Ubuntu as a virtual OS in Mac OS X
Authors: Dave Taylor
Venue: Linux Journal (2008)

How difficult is it to download, install and run Ubuntu Linux within the two popular virtualization environments for Mac OS X, VMware Fusion and Parallels Desktop, and is it a usable alternative to dual booting?
Contact force control of piezoresistive cantilevers with in-plane nanotips for femtoliter droplet deposition
Authors: Daisuke Saya, Thierry Leïchlé, Jean-Bernard Pourciel, Fabrice Mathieu, Christian Bergaud, Liviu Nicu
Venue: Microelectronic Engineering (2008)

For the purpose of biochip miniaturization, we developed a liquid spotter-based on silicon microcantilevers incorporating in-plane nanotips as a MEMS nanopatterning tool. We present new fabricated cantilevers with added piezoresistors for the contact force control during deposition. Matrices of droplets of 1@mm in diameter were achieved with a 10@mm interspot distance with high uniformity and high reproducibility by the nanotip cantilever with piezoresistive force controller.
Type inference for datalog and its application to query optimisation
Authors: Oege de Moor, Damien Sereni, Pavel Avgustinov, Mathieu Verbaere
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

Certain variants of object-oriented Datalog can be compiled to Datalog with negation. We seek to apply optimisations akin to virtual method resolution (a well-known technique in compiling Java and other OO languages) to improve efficiency of the resulting Datalog programs. The effectiveness of such optimisations strongly depends on the precision of the underlying type inference algorithm. Previous work on type inference for Datalog has focussed on Cartesian abstractions, where the type of each field is computed separately. Such Cartesian type inference is inherently imprecise in the presence of field equalities. We propose a type system where equalities are tracked, and present a type inference algorithm. The algorithm is proved sound. We also prove that it is optimal for Datalog without negation, in the sense that the inferred type is as tight as possible. Extensive experiments with our type-based optimisations, in a commercial implementation of object-oriented Datalog, confirm the benefits of this non-Cartesian type inference algorithm.
Asymmetric graph coloring games
Authors: H. A. Kierstead
Venue: Journal of Graph Theory (2005)

We introduce the (a,b)-coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors a vertices and Bob colors b vertices. We also introduce a related game, the (a,b)-marking game. We analyze these games and determine the (a,b)-chromatic numbers and (a,b)-coloring numbers for the class of forests and all values of a and b. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 48: 169&ndash;185, 2005
Constructing conceptual graphs using linguistic resources
Authors: Svetlana Hensman, John Dunnion
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

With the huge number of documents becoming available in electronic form, finding relevant information in a large corpus is becoming an increasingly important, but difficult, task. We believe that semantic processing is required in order to achieve more accurate information retrieval. This paper describes a framework for the creation of semantic markup and its insertion into XML documents. We describe the semi-automatic construction of conceptual graph representations of texts using a combination of existing linguistic resources, such as VerbNet and WordNet. The system we have developed uses a two-step approach, firstly identifying the semantic rôles in a sentence, and then using these rôles, together with semi-automatically compiled domain-specific knowledge, to construct the conceptual graph representation.
Short communication: An Invertebrate Semantic/Software Application Development Framework for knowledge-based systems
Authors: Yevgen Biletskiy, Girish R. Ranganathan
Venue: Knowledge-Based Systems (2008)

This paper presents an Invertebrate Semantic/Software Application Development Framework (ISADF) for building knowledge-based software systems. There are two main contributions of ISADF: it proposes a framework for the development of software for interoperability, and it proposes a software development approach, where all components, even application logic, are externalized from application.
Image Registration in Low Resolution Visual Sensor Networks
Authors: Harini Balasubramanian, Praveen Kumar Mitikiri, Kamesh R. Namuduri
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Image registration is of great interest in video surveillance because of its capability to combine images and generate a larger view of the area under observation, while retaining all the information in the images. This paper demonstrates a novel method for registering images obtained from low resolution visual sensor networks. It uses change detection as a tool for automatic identification of control points which form the basis for registering images.
An NGN middleware based on an enhanced IMS
Authors: Noëmie Simoni, Chunyang Yin, Rhéa Berberi, Ghislain Du Chene
Venue: Proceedings of the 2007 Workshop on Middleware for next-generation converged networks and applications (2007)

As one of the NGN architectures, IMS acts as a session middleware to offer the service session, which enables the operator to deliver the IMS-based Next Generation Services. But can the IMS architecture keep the promise of a quick TTM and with an acceptable ROI? In this paper, we focus on the service architecture in a service composition vision to respond the NGN requirements, making the convergence and all types of mobility possible. An NGN Middleware is proposed to compose, optimally select and invoke the service components (SEs). The proposition of a QoS Routing table of services and the new SIP protocol (SIP+) permits the End to End service session to be dynamic. An enhanced IMS addresses also an enhanced HSS to have the complete information as user preferences, user terminals and network subscription. This paper will detail these propositions through several scenarios.
Domain annotation of trimeric autotransporter adhesins—daTAA
Authors: Pawel Szczesny, Andrei Lupas
Venue: Bioinformatics (2008)

Motivation: Trimeric autotransporter adhesins (TAAs), such as Yersinia YadA, Neisseria NadA, Moraxella UspAs, Haemophilus Hia and Bartonella BadA, are important pathogenicity factors of proteobacteria. Their high sequence diversity and distinct mosaic-like structure lead to difficulties in the annotation of their sequences. These stem from the large number of short repeats, the presence of compositionally unusual coiled-coils, fuzzy domain boundaries and regions of seemingly low sequence complexity. Results: We have developed a workflow, named daTAA, for the accurate domain annotation of TAAs. Its core consists of manually curated alignments and of knowledge-based rules that enhance assignments made by sequence similarity. Compared to general domain annotation servers such as PFAM, daTAA captures more domains and provides more sensitive domain detection, as well as integrated and detailed coiled-coil assignments. Availability: The daTAA server is freely accessible at http://toolkit.tuebingen.mpg.de/dataa Contact: andrei.lupas@tuebingen.mpg.de Supplementary information: Supplementary data are available at Bioinformatics online.
Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Authors: James Harland, Prabhu Manyem
Venue: Conferences in Research and Practice in Information Technology Series; Vol. 316 (2008)

The fourteenth Computing: The Australasian Theory Symposium (CATS) is being held at the University of Wollongong, Australia during January 22-25, 2008. We received 28 submissions, out of which 17 were accepted. Each paper was thoroughly refereed by at least three reviewers from an international programme committee, followed by a healthy discussion among committee members. The keynote speech will be delivered by Eric Allender from Rutgers University, New Jersey, USA. Professor Allender is a world renowned authority on Computational Complexity. He is a Fellow of the ACM, as well as being an ACM Distinguished Scientist. A greater number of academics from around the world participated in the programme committee this year than previous years. The year is also notable in that students made a major contribution to a significant proportion (about one-third) of the accepted papers. This clearly forebodes a bright future for CATS.
Data sets and data quality in software engineering
Authors: Gernot A. Liebchen, Martin Shepperd
Venue: Proceedings of the 4th international workshop on Predictor models in software engineering (2008)

OBJECTIVE - to assess the extent and types of techniques used to manage quality within software engineering data sets. We consider this a particularly interesting question in the context of initiatives to promote sharing and secondary analysis of data sets. METHOD - we perform a systematic review of available empirical software engineering studies. RESULTS - only 23 out of the many hundreds of studies assessed, explicitly considered data quality. CONCLUSIONS - first, the community needs to consider the quality and appropriateness of the data set being utilised; not all data sets are equal. Second, we need more research into means of identifying, and ideally repairing, noisy cases. Third, it should become routine to use sensitivity analysis to assess conclusion stability with respect to the assumptions that must be made concerning noise levels.
Fast algorithm for computer simulation of optical systems with partially coherent illumination
Authors: Andrey S. Ostrovsky, Carolina Rickenstorff Parrao
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

The fast algorithm for calculating the bilinear transform in the optical system is proposed. This algorithm is based on the coherent-mode representation of the cross-spectral density function of the illumination. The algorithm is computationally efficient when the illumination is partially coherent. Numerical examples are studied and compared with theoretical results.
Efficient Shared Computations over Distributed Sites
Authors: Pedro Nuno San-Bento Furtado
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The computational grid offers services for efficiently scheduling jobs on the grid, but for grid-enabled applications where data handling is a most relevant part in performance, the data grid kicks in. It typically builds on the concept of files, sites and file transfers between sites using services such as GRID-ftp, plus a Replica Manager to keep track of where replicas are located. Usually, careful original data layout is not considered because the data can be moved based on some replica optimization models to computing sites. We consider cooperative shared computations for huge data that is distributed over a variable number of sites. In this context, data layout is a relevant problem because moving very large amounts of data is too expensive. Consequently, it is a balance between data layout and load-balancing capabilities on top of the basic infra-structure that is the most crucial issue. In this paper we propose a mixed replication layout and load-balancing approach to yield very good performance results in such environments.
Boundary singularities of solutions to integal equations of the second kind
Authors: Arvet Pedas, Gennadi Vainikko
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

We study the smoothness and the singularities of the solution to Fredholm and Volterra integral equations of the second kind on a bounded interval. The kernel of the integral operator may have diagonal and boundary singularities.