ppxscal/embedding_network huggingface dataset:
Who is LB1? Discriminant analysis for the classification of specimens
Authors: Aleix M. Martinez, Onur C. Hamsici
Venue: Pattern Recognition (2008)

Many problems in paleontology reduce to finding those features that best discriminate among a set of classes. A clear example is the classification of new specimens. However, these classifications are generally challenging because the number of discriminant features and the number of samples are limited. This has been the fate of LB1, a new specimen found in the Liang Bua Cave of Flores. Several authors have attributed LB1 to a new species of Homo, H. floresiensis. According to this hypothesis, LB1 is either a member of the early Homo group or a descendent of an ancestor of the Asian H. erectus. Detractors have put forward an alternate hypothesis, which stipulates that LB1 is in fact a microcephalic modern human. In this paper, we show how we can employ a new Bayes optimal discriminant feature extraction technique to help resolve this type of issues. In this process, we present three types of experiments. First, we use this Bayes optimal discriminant technique to develop a model of morphological (shape) evolution from Australopiths to H. sapiens. LB1 fits perfectly in this model as a member of the early Homo group. Second, we build a classifier based on the available cranial and mandibular data appropriately normalized for size and volume. Again, LB1 is most similar to early Homo. Third, we build a brain endocast classifier to show that LB1 is not within the normal range of variation in H. sapiens. These results combined support the hypothesis of a very early shared ancestor for LB1 and H. erectus, and illustrate how discriminant analysis approaches can be successfully used to help classify newly discovered specimens.
Reference architecture knowledge representation: an experience
Authors: Elisa Yumi Nakagawa, José Carlos Maldonado
Venue: Proceedings of the 3rd international workshop on Sharing and reusing architectural knowledge (2008)

Software architectures have played a significant role in determining the success of software systems. In spite of impact of the architectures to the software development and, as a consequence, to the software quality, there is not yet a consensus about which mechanisms work better to describe these architectures. In addition, despite the relevance of reference architectures as an artifact that comprises knowledge of a given domain and supports development of systems for that domain, issues related to their representation have not also had enough attention. In this perspective, this work intends to contribute with an experience of representing reference architectures aiming at easily sharing and reusing knowledge in order to develop software systems. A case study on software testing is presented illustrating our experience.
Fairness of High-Speed TCP Stacks
Authors: Dimitrios Miras, Martin Bateman, Saleem Bhatti
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

We present experimental results evaluating fairness of several proposals to change the TCP congestion control algorithm, in support of operation on high bandwidth-delay-product (BDP) network paths. We examine and compare the fairness of New Reno TCP, BIC, Cubic, Hamilton-TCP, Highspeed-TCP and Scalable-TCP. We focus on four different views of fairness: TCP-friendliness, RTT-fairness, intra- and inter-protocol fairness.
The Performance of HSDPA (3.5 G) Network for Application in a Navigation System for Visually Impaired People
Authors: Khalid Alhajri, Nawzad Al-Salihi, Vanja Garaj, Ziad Hunaiti, Wamadeva Balachandran
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

This paper presents the outcome of the research study conducted as a part of the ongoing development of the Brunel Navigation System for the Blind. The main aim of the study was to carry out a performance assessment to be used with High Speed Downlink Packet Access (HSDPA) 3.5G wireless technology for utilization in Brunel visually impaired navigation system. The performance assessment was focused on the following 3.5G link features: delay, throughput, jitter and packet loss. These features were chosen to be assessed because they have a significant impact on the overall performance of the navigation system. The assessment involved the use of the 3.5G networks by TMobile and Vodafone. The study was conducted at Brunel University campus in Uxbridge, where the navigation system for the visually impaired is being developed. The results show that the HSDPA can be successfully used to establish the navigation system for the visually impaired people.
Minimum weight feedback vertex sets in circle graphs
Authors: Fanica Gavril
Venue: Information Processing Letters (2008)

We describe a polynomial time algorithm to find a minimum weight feedback vertex set, or equivalently, a maximum weight induced forest, in a circle graph. The circle graphs are the overlap graphs of intervals on a line.
Teaching materials to enhance the visual expression of Web pages for students not in art or design majors
Authors: Taeko Ariga, Takashi Watanabe
Venue: Computers Education (2008)

The explosive growth of the Internet has made the knowledge and skills for creating Web pages into general subjects that all students should learn. It is now common to teach the technical side of the production of Web pages and many teaching materials have been developed. However teaching the aesthetic side of Web page design has been neglected, and students not in art or design majors are normally confronted with difficulties when they do expressive design of Web pages. This paper proposes a learning process using worksheets called the Image-Plot and the Standard Design Table. These were developed as teaching materials for courses on the production of Web pages in universities and colleges. The learning process focuses especially on how to enhance the visual expression of Web pages. Using these worksheets for courses on the production of Web page raised students' consciousness of Web pages visual expression.
Progressive transmission of appearance preserving octree-textures
Authors: Julien Lacoste, Camille Perin, Bruno Jobard
Venue: Proceedings of the 13th international symposium on 3D web technology (2008)

The development of shape repositories and 3D databases rises the need of online visualization of 3D objects. The main issue with the remote visualization of large meshes is the transfer latency of the geometric information. The remote viewer requires the transfer of all polygons before allowing object's manipulation. To avoid this latency problem, an approach is to send several levels of details of the same object so that lighter versions can be displayed sooner and replaced with more detailed version later on. This strategy requires more bandwidth, implies abruptly changes in object aspect as the geometry refines as well as a non negligible precomputing time. Since the appearance of a 3D model is more influenced by its normal field than its geometry, we propose a framework in which the object's LOD is replaced with a single simplified mesh with a LOD of appearance. By using Appearance Preserving Octree-Textures (APO), this appearance LOD is encoded in a unique texture, and the details are progressively downloaded when they are needed. Our APO-based framework achieves a nearly immediate object rendering while details are transmitted and smoothly added to the texture. Scenes keep a low geometry complexity while being displayed at interactive framerate with a maximum of visual details, leading to a better visual quality over bandwith ratio than pure geometric LOD schemes. Our implementation is platform independent, as it uses JOGL and runs on a simple web browser. Furthermore the framework doesn't require processing on the server side during the client rendering.
A semi-induced subgraph characterization of upper domination perfect graphs
Authors: Igor E. Zverovich, Vadim E. Zverovich
Venue: Journal of Graph Theory (1999)

Let &beta;(G) and &Gamma;(G) be the independence number and the upper domination number of a graph G, respectively. A graph G is called &Gamma;-perfect if &beta;(H) = &Gamma;(H), for every induced subgraph H of G. The class of &Gamma;-perfect graphs generalizes such well-known classes of graphs as strongly perfect graphs, absobantly perfect graphs, and circular arc graphs. In this article, we present a characterization of &Gamma;-perfect graphs in terms of forbidden semi-induced subgraphs. Key roles in the characterization are played by the odd prism and the even M&ouml;bius ladder, where the prism and the M&ouml;bius ladder are well-known 3-regular graphs [2]. Using the semi-induced subgraph characterization, we obtain a characterization of K1,3-free &Gamma;-perfect graphs in terms of forbidden induced subgraphs. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 31:2949, 1999
Low-power multi-core ATPG to target concurrency
Authors: Arkan Abdulrahman, Spyros Tragoudas
Venue: Integration, the VLSI Journal (2008)

A function-based automatic test pattern generation (ATPG) tool for embedded core testing is presented that reduces test cost and considers test power dissipation of system-on-chip (SoC). Cores are tested concurrently with the use of test functions, as opposed to simple patterns, and by I/O pin allocation on the test access mechanism (TAM) during a compact ATPG process. Turnaround time benefits from pre-existing test vectors, or test functions supplied by the provider of each core. The presented method also targets low-power dissipation by considering the switching activity on the SoC inputs. Experimental results show a significant reduction in the test application time due to the achieved level of concurrency.
Pulsatile flow of blood using a modified second-grade fluid model
Authors: Mehrdad Massoudi, Tran X. Phuoc
Venue: Computers Mathematics with Applications (2008)

We study the unsteady pulsatile flow of blood in an artery, where the effects of body acceleration are included. The blood is modeled as a modified second-grade fluid where the viscosity and the normal stress coefficients depend on the shear rate. It is assumed that the blood near the wall behaves as a Newtonian fluid, and in the core as a non-Newtonian fluid. This phenomenon is also known as the Fahraeus-Lindqvist effect. The equations are made dimensionless and solved numerically.
Finding diamonds in the rough
Authors: Kirk L. Kroeker
Venue: Communications of the ACM (2008)

Spectral graph theory has proven to be very useful for text search and retrieval and for refining predictive-analysis systems.
Constructing O(n Log n) Size Monotone Formulae For The k-th Elementary Symmetric Polynomial Of n Boolean Variables
Authors: J. Friedman
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

In this paper, we construct formulae for the k-th elementary symmetry polynomial of n Boolean variables, using only conjunction and disjunction, which for fixed k are of size O(n log n), with the construction taking time polynomial in n. We also prove theorems involving n log n/spl middot/(polynomial in k) upper bounds on such formulae. Our methods involve solving the following combinatorial problem: for fixed k and any n construct a collection of r=O(log n) functions f/sub 1/,...,f/sub r/ from {1,...,n} to {1,...,K} such that any subset of {1,...,n} of order k is mapped 1-1 to {1,...,k} by at least one f/sub i/.. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Learning Reliable Classifiers From Small or Incomplete Data Sets: The Naive Credal Classifier 2
Authors: Giorgio Corani, Marco Zaffalon
Venue: The Journal of Machine Learning Research (2008)

In this paper, the naive credal classifier, which is a set-valued counterpart of naive Bayes, is extended to a general and flexible treatment of incomplete data, yielding a new classifier called naive credal classifier 2 (NCC2). The new classifier delivers classifications that are reliable even in the presence of small sample sizes and missing values. Extensive empirical evaluations show that, by issuing set-valued classifications, NCC2 is able to isolate and properly deal with instances that are hard to classify (on which naive Bayes accuracy drops considerably), and to perform as well as naive Bayes on the other instances. The experiments point to a general problem: they show that with missing values, empirical evaluations may not reliably estimate the accuracy of a traditional classifier, such as naive Bayes. This phenomenon adds even more value to the robust approach to classification implemented by NCC2.
Dependency Analysis of Message Packet Queues in Interconnection Networks with Faults
Authors: Farshad Safaei, Ahmad Khonsari, Morteza Analoui, Aresh Dadlani
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Many contemporary communication networks carry different types of traffics, each bearing specific characteristics of their own. The arrival process of packets outsourced from every single source node is approximated to a Poisson arrival process. Mostly, in network performance models, the exponential nature of the inter-arrival time in fault-free networks is determined by the dependency between inter-arrival times. But in most of the communication environments, in addition to minimizing packet delays and maximizing the network throughput, continuous functionality in the presence of faulty components has become a major issue. On such basis, the dependency phenomenon between consecutive service times as well as between service and inter-arrival times for packet queues in interconnection networks and in the vicinity of the faulty components can be of great importance. In this paper, we analyze the effect of such dependencies in packet queues through simulation experiments. We also study the behavior of an M/G/1 queue with Poisson processes in face of faults. This study can be used to justify the predicted packet delays obtained from analytical models under diverse traffic patterns and various network conditions and prove beneficial by enlightening the limitations of network analytical approaches in using approximation methods for evaluating network of queues.
Variation Aware Spline Center and Range Modeling for Analog Circuit Performance
Authors: Shubhankar Basu, Balaji Kommineni, Ranga Vemuri
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

With scaling technologies, process variations have increased significantly. This has led to deviations in analog performance from their expected values. Performance macromodeling aids in reduction of synthesis time by removing the simulation overhead. In this work, we develop a novel Spline based Center and Range Method (SCRM) for process Variation Aware Performance MACromodeling (VAPMAC) which works on interval valued data. Experiments demonstrate around 200K times computational time advantage using VAPMAC generated macromodels over SPICE monte carlo simulation. The results also demonstrate less than 10% loss in accuracy in computing the performance bounds using the macromodels compared to the spice simulations.
Sub-grid parameterisation of fluvio-deltaic processes and architecture in a basin-scale stratigraphic model
Authors: Rory A. F. Dalman, Gert Jan Weltje
Venue: Computers Geosciences (2008)

We present a parameterisation of fluvio-deltaic drainage network evolution and alluvial architecture in a basin-scale 2-DH model. The model setup is capable of producing convergent and divergent channel networks. Major elements are the alluvial-ridge aggradation and the coupled overbank deposition, the dimension and style of the channel belt and the sub-grid stratigraphic expression. Avulsions are allowed to develop out of randomly instigated crevasses. Channel stability is modelled one dimensionally by calculating the flow and sediment transport at prospective avulsion nodes. The ultimate fate of crevasses (failed avulsion, successful avulsion, stable bifurcation) depends on the ratio of cross-valley and in-channel gradients in the local neighbourhood of the grid cell under consideration and on the amount and distribution of the suspended sediment load in the water column. The sub-grid parameterisation yields implicit knowledge of the alluvial architecture, which may be analysed stochastically. Stochastic realisations of the alluvial architecture allow us to investigate the relationship between basin-fill architecture and small-scale alluvial architecture, which is likely to improve geological reservoir modelling of these notoriously complex deposits. Modelling results under conditions of time-invariant forcing indicate significant quasi-cyclic autogenic behaviour of the fluvio-deltaic system. Changes in the avulsion frequency are correlated with the number and length of distributary channels, which are in turn related to alternating phases of progradational and aggradational delta development. The resulting parasequences may be difficult to distinguish from their allogenically induced counterparts.
Adapting Constant Modulus Algorithm for Phase Modulation Signals
Authors: Xin Wang, Guangzeng Feng
Venue: Proceedings of the Seventh International Conference on Networking (2008)

A novel blind constant modulus algorithm (CMA) for phase modulation signals is proposed. Compared with the CMAs before, this method, which exploits the relative phase information concealed in the M-PSK signals, has the ability to detect the types of modulation without the training information. Furthermore, this idea can apply to the continuous-varying modulation scheme systems. With the detected modulation scheme, the received signals can be recovered correctly. Simulation results prove the superiority of this new method.
Modeling Health Service Centers with Simulation and System Dynamics
Authors: Ying Su, Zhanming Jin
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

This paper describes the simulation modeling for redesigning health service centers at a medical consultation corporation Ltd. Research was performed in an effort to improve health service, in particular to reduce average waiting times as well as their variability. Discrete-event simulation modeling provided valuable input into new facility design decisions and showed the efficacy of pooling sources of variation, particularly patient demand and service times. Initial performance of the redesigned facilities was positive; however, dynamic feedback within the system of service centers eventually resulted in unanticipated performance problems. System dynamics models were developed to help predict these implementation problems and suggest some ways to improve results.
A Network of Time-Division Multiplexed Wiring for FPGAs
Authors: Rosemary Francis, Simon Moore, Robert Mullins
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

Our investigation into Networks-on-Chip for Field-Programmable Gate Arrays (FPGAs) indicates that fine-grain time-division multiplexing over configurable wires can significantly reduce the number of interconnects needed and therefore reduce chip area. We have investigated the impact of using different proportions of time-multiplexed shared wiring and conventional wiring on the number of wires needed per channel. To do this we have written a scheduler to map benchmarks to the wire sharing architecture. The algorithm developed allows us to trade off between wire count and latency. This is the first time that the statically configured FPGA wiring has been entirely replaced by time-multiplexed wiring. Our results indicate that time-multiplexed wiring could be an effective way of making better use of the on-chip resources and enable the use of on-chip networks with low overheads.
Simultaneous on-chip bus synthesis and voltage scaling under random on-chip data traffic
Authors: Sujan Pandey, Manfred Glesner
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This paper presents a statistical approach to synthesize an energy conscious the optimal bus width and the number of buses. The slack is exploited to maximize bus sharing and to reduce energy consumption by simultaneously scaling the voltage during the synthesis of on-chip communication bus. An assumption for bus synthesis is that a system has been partitioned and mapped onto the appropriate modules of a system-on-chip (SoC). Because of the diversity of applications to be run on a single SoC, there exists a variability of data size to be transferred among the on-chip communicating modules. This variability of data size is modeled as a random variable with a known distribution function. The resulting synthesis problem is relaxed to a convex quadratic optimization problem and solved efficiently using a convex optimization tool. The effectiveness of our approach is demonstrated by applying optimization to an automatically generated benchmark and a real-life application. By scaling voltage of a bus, a tradeoff between communication bus cost (bus width and the number of buses) and energy reduction is explored. The experimental results show the significant reduction in communication energy with scaling voltage. However, it offers a limitation to minimize the communication bus cost, if the voltage is scaled beyond its minimum limit. Furthermore, we also estimate the distribution of voltage under a random data size using an analytical method and the Monte Carlo simulation. The results show that the analytically estimated statistical parameters of voltage are close to the simulated results.
A call to arms: it's time for REAL mobility models
Authors: Chris Walsh, Arta Doci, Tracy Camp
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

The choice of a mobility model has a significant impact on the performance of mobile network simulations. In order to accurately evaluate performance, it is important to mimic the environment in which the mobile network will be deployed. Thus, using realistic mobility models for simulation environments are preferred to synthetic models. Historically, however, unrealistic movement models have been mostly used due to their simplicity and mathematical tractability. Recently, a few mobility models have been derived from real user traces; these models, however, have not yet been adopted by the mobile research community for evaluation of protocol performance. We have implemented a realistic university campus-based pedestrian mobility model (RealMobGen) for use with the NS-2 network simulator. We offer RealMobGen to anyone interested.
Enabling a cooperative strategy in mobile ad-hoc networks
Authors: Marcos Dantas Ortiz, José Neuman de Souza, Acélio Sousa C. de Aguiar, Diogo Aguiar Lim
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

In ad hoc mobile networks, communication management is done by the devices themselves (nodes) in an autonomous way. Forwarding of packets is an essential service done by the nodes to the maintenance of the network's connectivity. However, forwarding a packet demands energy, a scarce resource in a mobile device. This work presents an autonomous strategy of incentivating the cooperation in ad hoc networks based in credits and reputation. As incentivate, the nodes that forwards packets, receive credits that are used to send own packets with a better Quality of Service (QoS). The strategy uses only local information and there is no need of a central station to manage incentive application.