ppxscal/embedding_network huggingface dataset:
Scalable and Practical Nonblocking Switching Networks (Extended Abstract)
Authors: S. Q. Zheng
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

Switching networks are widely used as core components in network switches and routers, and communication subsyetems in parallel computing systems. Most switching networks are multistage interconnection networks built with small-size switching elements. Nonblocking switching networks have been favored because of their capability of setting up any one-to-one I/O connections. There are three types of nonblocking networks: strictly nonblocking (SNB), wide-sense nonblocking(WSNB) and rearrangeable nonblocking (RNB). In both SNB and WSNB networks, a connection can be established from any idle input to any idle output without disturbing existing connections. In SNB networks any of available conflict-free paths for a connection can be chosen and inWSNB networks, however, a rulemust be followed to choose one. The high degree of connection capability in SNB and WSNB networks is at a high hardware cost. RNB networks, usually constructed with lower hardware cost, can establish a conflict-free path for the connection from any idle input to any idle output if the rearrangement of existing connections is allowed. Large-scale SNB and WSNB switching networks, which are suitable for circuit switching, are usually infeasible in practice due to their high cost. In contrast, rearrangeable networks are more scalable because of their much lower cost. However, rearrangeable networks are not suitable for circuit switching. Over the years, a rich theory of nonblocking switching networks has been developed. Unfortunately, no explicitly constructable optimal-cost SNB and WSNB network has been discovered. Known powerful nonblocking networks are either costly and unscalable, or very inefficient in routing connections. In this talk, we introduce the the notion of virtual nonblockingness and almost nonblockingness, and the concepts of virtual nonblocking (VNB) networks and almost nonblocking (ANB) networks.
Multi-level spectral galerkin method for the navier-stokes problem I : spatial discretization
Authors: Yinnian He, Kam-Moon Liu, Weiwei Sun
Venue: Numerische Mathematik (2005)

A multi-level spectral Galerkin method for the two-dimensional non-stationary Navier-Stokes equations is presented. The method proposed here is a multiscale method in which the fully nonlinear Navier-Stokes equations are solved only on a low-dimensional space ** subsequent approximations are generated on a succession of higher-dimensional spaces ** j=2, . . . ,J, by solving a linearized Navier-Stokes problem around the solution on the previous level. Error estimates depending on the kinematic viscosity 0<&#x03bd;<1 are also presented for the J-level spectral Galerkin method. The optimal accuracy is achieved when ** We demonstrate theoretically that the J-level spectral Galerkin method is much more efficient than the standard one-level spectral Galerkin method on the highest-dimensional space **.
Secure Content Delivery using Key Composition
Authors: Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Hann-Huei Chiou, Chin-Laung Lei
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In this paper, we propose a novel framework for secure multicast on overlay networks. Our contributions are threefold: 1) a technique key composition is proposed to cope with the secure multicast problems, 2) the proposed framework is totally distributed, i.e., no centralized control is required for subgroup configurations, and 3) a comparison of similar frameworks is provided, in which we show the proposed framework is more efficient in that its time and space complexity are bounded by constants, regardless of the number of coexisting groups, the group size, and the degree of transit nodes.
Automated documentation in systems analysis and design
Authors: Lois A. Rose
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

It seems that proper documentation of systems analysis and systems design is the most tedious, time-consuming portion of systems development. Yet few people would challenge its importance. 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
Antennas for RFID tags
Authors: Smail Tedjini, Tan-Phu Vuong, Vincent Beroulle
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

This communication covers the design and optimization of antennas for RFID tags at UHF and microwave frequencies. Such design will focus on the specific characteristics of RFID applications such as back-scattering mode, variability of substrates and low cost constraints. The introduction includes a short history of RFID development. The second part will address the main characteristics of RFID antennas. The third part introduces the material characterization. Current developments of RFID antennas that meet the objectives of low-cost and size reduction are presented in part four. Design of antennas on plastic substrate using conductive inks will be shown as an example of low-cost approach. Advanced design techniques for size reduction, such as fractal techniques will be introduced and some design examples will be discussed. The fifth part concerns antenna modeling from the system point of view and examples of system simulation of an RFID communication will be shown.
A Framework for Designing Emotional Agents as Tutoring Entities
Authors: Bogdan Florin Marin, Axel Hunger, Stefan Werner
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

The use of animated agents in computer based learning environments as a tutoring paradigm can be benefic and increase the learners' motivation. This paper discusses the premises under which synthetic agents can be pedagogically effective as tutors in a collaborative learning environment. This research is a follow-up of our previous investigation on usage of agent technology in distance learning environments [4]. This work will highlight a framework for creating believable synthetic agents.
Mining coherent patterns and clusters from genomic data
Authors: Aidong Zhang
Venue:  (2005)

Recent high-throughput biotechnologies have generated various large-scaled biological data, such as genome sequences, protein structures, gene expression measurements, protein-protein interactions and DNA binding data. These ever-increasing genomic data provide us opportunities to explore the modular organization of the cell on a genome-wide scale. As the first step toward exciting knowledge discovery, mining hidden patterns and clusters in genomic data is a critical task in bioinformatics research and biomedical applications. In particular, microarray technology has made it possible to monitor the expression levels of thousands of genes in parallel. Many clustering algorithms have been applied to microarray data to find co-expressed genes and coherent gene expression patterns. However, due to the specific characteristics of microarray data and the special requirements from the domain of biology, clustering microarray data is still facing several challenges. In this dissertation, we first propose three novel approaches which effectively and efficiently identify coherent expression patterns (1) across the whole experimental conditions; (2) over subsets of samples or sub-intervals of time-series; and (3) embeded in three-dimensional microarray data, respectively. Being the experimental results from high-throughput technologies, large-scaled genomic data are typically noisy. Mining a single type of genomic data may not lead to reliable and meaningful results. It has been suggested that combining multiple data sets is likely to discover interesting, novel, and reliable patterns that cannot be obtained solely from any single source. In this dissertation, we also study the problem of joint mining across multiple genomic data sets. We propose a cross-graph quasi-clique model to describe the clusters which are consistently supported by heterogeneous data sources. Efficient algorithms have been developed to search the cross-graph quasi-cliques from multiple data sets. We conduct extensive performance study for our approaches on both real data and synthetic data. The mining results from real data sets have proved to be biologically meaningful. Moreover, our approaches are robust to parameters and are scalable to large data sets.
A Basic Mathematical Framework for Conceptual Graphs
Authors: Philip H. P. Nguyen, Dan Corbett
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

Based on the original idea of Sowa on conceptual graph and a recent formalism by Corbett on ontology, this paper presents a rigorous mathematization of basic concepts encountered in the Conceptual Structure Theory, including canon, ontology, conceptual graph, projection, and canonical formation operations, with the aim of deriving their mathematical properties and applying them to future research and development on knowledge representation. Our proposed formalism enhances the Conceptual Structure Theory and enables it to compare favorably with other alternative methods such as the Formal Concept Analysis theory.
Characterization of Combinatorially Independent Permutation Separability Criteria
Authors: Pawel Wocjan, Michal Horodecki
Venue: Open Systems Information Dynamics (2005)

The so-called permutation separability criteria are simple operational conditions that are necessary for separability of mixed states of multipartite systems: (1) permute the indices of the density matrix and (2) check if the trace norm of at least one of the resulting operators is greater than one. If it is greater than one then the state is necessarily entangled. A shortcoming of the permutation separability criteria is that many permutations give rise to equivalent separability criteria. Therefore, we introduce a necessary condition for two permutations to yield independent criteria called combinatorial independence. This condition basically means that the map corresponding to one permutation cannot be obtained by concatenating the map corresponding to the second permutation with a norm-preserving map. We characterize completely combina-torially independent criteria, and determine simple permutations that represent all independent criteria. The representatives can be visualized by means of a simple graphical notation. They are composed of three basic operations: partial transpose, and two types of so-called reshufflings. In particular, for a four-partite system all criteria except one are composed of partial transpose and only one type of reshuffling; the exceptional one requires the second type of reshuffling. Furthermore, we show how to obtain efficiently a simple representative for every permutation. This method allows to check easily if two permutations are Combinatorially equivalent or not.
Fault tolerant on-board networks with priorities
Authors: J.-C. Bermond, F. Havet, C. D. Tóth
Venue: Networks (2006)

We consider on-board networks in satellites interconnecting entering signals (inputs) to amplifiers (outputs). The connections are made via expensive switches, each of which has four available links. The paths connecting inputs to outputs should be link-disjoint. Some of the input signals, called priorities, must be connected to the amplifiers that provide the best quality of service (that is, to some specific outputs). In practice, amplifiers are prone to fail, and the faults cannot be repaired. Therefore, extra outputs have to be built into the network to ensure that every input can be routed to operational outputs. Given three integers, n, p, and f, we would like to design a low-cost network (where the network cost is proportional to the total number of switches) such that it is possible to route all n inputs to n operational amplifiers, and to route the p priorities to the p best quality amplifiers for any set of f faulty and p best-quality amplifiers. Let R(n, p, f) be the minimum number of switches of such a network. We prove here that $R(n,p,f)\leq{{n+f}\over{2}}\lceil\log_2p\rceil+{{5}\over{2}}(n-p)+g(f)$ with g a function depending only on f. We then compute R(n, p, f) exactly for a few small values of p and f. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 47(1), 9&ndash;25 2006
On a Traffic Control Problem
Authors: WEIZHEN GU, XINGDE JIA
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

A traffic network can be modeled by a digraph, while the traffic sensor location problem can be studied by using a minimum edge control set which is defined as follows. Let G = (V,E) be a digraph. A subset F of the edge set E is called an edge control set of G if every flow of G is completely determined by F. An edge control set F is said to be minimum if |F| is the least cardinality among all edge control sets of G. In this paper an algorithm for constructing a minimum edge control set of any digraph is established.
New Evolutionary Bankruptcy Forecasting Model Based on Genetic Algorithms and Neural Networks
Authors: Trabelsi Abdelwahed, Esseghir Mohamed Amir
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

One of the problem still gaining a great attention in financeis the bankruptcy forecasts. The problem of efficient bankruptcy prognosis is of great interest both to scientists and practitioners. Numerous models have been developed to forecast bankruptcy prediction from statistical models to artificial intelligence techniques. We propose, in this study, a new hybrid model (EBM: Evolutionary Bankruptcy Model) based on genetic algorithms and artificial neural networks. Our evolutionary model is able of: selecting the best set of predictive variables, then, searching for the best neural network classifier and improving classification and generalization accuracies. Carried out experiments have shown a very promising results of EBM for bankruptcy prediction in terms of predictive accuracy and adaptability.
Extensions to fixed priority with preemption threshold and reservation-based scheduling
Authors: Jiongxiong Chen
Venue:  (2005)

This thesis focuses on two real-time scheduling algorithms: fixed-priority with preemption threshold (FPPT) and the reservation-based algorithm (RBA). FPPT is an important form of real-time scheduling algorithm that generalizes both fixed-priority preemptive (FPP) and fixed-priority non-preemptive (FPNP), i.e., FPP and FPNP are the two boundary cases for FPPT. The critical instant for FPPT is rephrased, and it is shown that FPPT is robust under its critical instant. When a task set is schedulable by FPPT with predefined regular priorities, there may exist multiple valid preemption threshold assignments, which are proved to be delimited by two special assignments, called minimal and maximal assignment respectively. This thesis presents effective algorithms to compute the minimal and maximal assignment by starting from FPNP In addition, algorithms are presented to compute the minimal (maximal) assignment when the other is known. The maximal assignment reduces the number of context switches and can eliminate some resource sharing issues. It is shown that the algorithm to find the maximal assignment can be used to perform a schedulability test for FPPT. Resource management protocols for FPPT are not addressed in this work, which is left for future study. RBA is a kind of bandwidth reservation algorithm in which an even duration of time (the bandwidth) is made available for executing aperiodic tasks to improve their response time. This thesis provides the theoretical support to compute the maximal size of the reserved bandwidth after guaranteeing schedulability of a periodic task set for earliest deadline first (EDF), rate monotonic (RMA), and FPPT algorithms. When RMA is used to schedule periodic tasks, the known algorithm to calculate the reservation size is complicated and ineffective. It is shown that the combination of RBA and FPPT can obtain a reservation size no smaller than that of RMA and avoid the high run-time cost of EDF. Combined with a background server, the response time of aperiodic tasks can be further improved. However, this thesis does not consider all practical issues. For example, the bandwidth may be too small and the practical costs of additional context switching may be expensive. To verify the research results of this thesis, a small real-time scheduling tool-kit was created as part of the thesis work. The tool-kit allows scheduling algorithms to be created and tested (via simulations), where scheduling results are presented as step-by-step Gantt-charts. The tool-kit was invaluable in generating examples to prove or disprove different aspects of the scheduling work for the thesis. The tool-kit has been extended with multiple scheduling algorithms, not just those specific to this thesis.
Evaluating Early Prototypes in Context: Trade-offs, Challenges, and Successes
Authors: Derek Reilly, Dave Dearman, Michael Welsman-Dinelle, Kori Inkpen
Venue: IEEE Pervasive Computing (2005)

Evaluating early prototypes in context is a challenging but critical part of design in pervasive computing. Early-prototyping approaches that ultimately sacrifice some realism or allow some bias in order to approximate contextual evaluation, while limited, provide useful evaluations of design choices early during development.This article is part of a special issue on rapid prototyping.
There's more to a model than code: understanding and formalizing in silico modeling experience
Authors: Janet Wiles, Nic Geard, James Watson, Kai Willadsen, John Mattick, Daniel Bradley, Jennifer Hallinan
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Mapping biology into computation has both a domain specific aspect -- biological theory -- and a methodological aspect -- model development. Computational modelers have implicit knowledge that guides modeling in many ways but this knowledge is rarely communicated. We review the challenge of biological complexity and current practices in modeling genetic regulatory networks with the aim of understanding characteristics of the in silico modeling process and proposing directions for future improvements. Specifically, we contend that the modeling of complex biological systems can be made more efficient and more effective by the use of structured methodologies incorporating experience about modeling algorithms and implementation. We suggest that an appropriate formalism is Complex Systems Patterns, adopted from Design Patterns in software engineering. First steps towards building community resources for such patterns are described.
A new selection method for H.264 based fine granular scalable video coding
Authors: Won-Hyuck Yoo, Jihun Cha, Won-Sik Jeong, Kyuheon Kim, Gwang Hoon Park
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we introduce a new selection method for H.264 based Fine Granular Scalable video coding. It selectively uses the temporal-prediction data inside the enhancement-layer only when those data can significantly reduce the temporal-redundancies, thereby the improvement of the overall coding efficiency is accomplished by minimizing the drift errors. Simulation results show that the proposed scheme has 1~3 dB better coding efficiency than H.264-based FGS coding scheme.
The Epistemology and Ontology of Human-Computer Interaction
Authors: Philip Brey
Venue: Minds and Machines (2005)

This paper analyzes epistemological and ontological dimensions of Human-Computer Interaction (HCI) through an analysis of the functions of computer systems in relation to their users. It is argued that the primary relation between humans and computer systems has historically been epistemic: computers are used as information-processing and problem-solving tools that extend human cognition, thereby creating hybrid cognitive systems consisting of a human processor and an artificial processor that process information in tandem. In this role, computer systems extend human cognition. Next, it is argued that in recent years, the epistemic relation between humans and computers has been supplemented by an ontic relation. Current computer systems are able to simulate virtual and social environments that extend the interactive possibilities found in the physical environment. This type of relationship is primarily ontic, and extends to objects and places that have a virtual ontology. Increasingly, computers are not just information devices, but portals to worlds that we inhabit. The aforementioned epistemic and ontic relationships are unique to information technology and distinguish human-computer relationships from other human-technology relationships.
Reliability of multistacked tantalum-based structure as the barrier film in ultralarge-scale integrated metallization
Authors: Keng-Liang Ou, Chi-Chang Wu, Chiung-Chi Hsu, Chin-Sung Chen, Yih-Chuen Shyng, Wen-Fa Wu
Venue: Microelectronic Engineering (2005)

Diffusion barrier properties of Ta films with and without plasma treatments have been investigated in the study. The nitrogen-incorporated Ta films were prepared by NH"3 plasma treatment or reactive sputtering. Barrier properties were evaluated by sheet resistance, X-ray diffraction, transmission electron microscopy, X-ray photoelectron spectroscopy and reverse-biased junction leakage current. An amorphous-like TaN"x layer was formed on Ta barrier film after plasma treatments. The thickness of the amorphous TaN"x layer is about 3nm and NH"3 plasma-treated Ta films (TaN"x/Ta) possess lower resistivity and smaller grain sizes. The Cu/TaN"x/Ta(10nm)/Si remained stable after annealing at 750^oC for 1h. NH"3 plasma-treated Ta films (TaN"x/Ta) possess better thermal stability than Ta and TaN films. It is attributed to the formation of a new amorphous layer on the surface of Ta film after the plasma treatments. For thermal stability of Cu/Ta(-N)/n^+-p diodes, Cu/Ta/n^+-p and Cu/TaN/n^+-p junction diodes resulted in large reverse-bias junction leakage current after annealing at 500 and 525^oC, respectively. On the other hand, TaN"x/Ta diffusion barriers will improve the integrity of Cu/Ta(-N)/n^+-p junction diodes to 650^oC.
The Fourier Singular Complement Method for the Poisson problem. Part I: prismatic domains
Authors: P. Ciarlet Jr, B. Jung, S. Kaddouri, S. Labrunie, J. Zou
Venue: Numerische Mathematik (2005)

This is the first part of a threefold article, aimed at solving numerically the Poisson problem in three-dimensional prismatic or axisymmetric domains. In this first part, the Fourier Singular Complement Method is introduced and analysed, in prismatic domains. In the second part, the FSCM is studied in axisymmetric domains with conical vertices, whereas, in the third part, implementation issues, numerical tests and comparisons with other methods are carried out. The method is based on a Fourier expansion in the direction parallel to the reentrant edges of the domain, and on an improved variant of the Singular Complement Method in the 2D section perpendicular to those edges. Neither refinements near the reentrant edges of the domain nor cut-off functions are required in the computations to achieve an optimal convergence order in terms of the mesh size and the number of Fourier modes used.
A Broadband Quadrature-Modulator in Standard 0.13 µm CMOS
Authors: Esa Tiiliharju, Kari Halonen
Venue: Analog Integrated Circuits and Signal Processing (2006)

A polyphase filtering topology is proposed which uses parallel switchable RC-networks for accurate broadband 90¿ phasing. A 0.13¿m CMOS prototype using the quadrature-generation network in a direct-conversion quadrature-modulator achieves a measured image-rejection ratio of ¿39 dBc or better in 0.6---2.5 GHz while consuming only 66 mW from a 2.2 V single supply.