ppxscal/embedding_network huggingface dataset:
Star factorizations of graph products
Authors: Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden
Venue: Journal of Graph Theory (2001)

A k-star is the graph K1,k. We prove a general theorem about k-star factorizations of Cayley graphs. This is used to give necessary and sufficient conditions for the existence of k-star factorizations of any power (Kq)s of a complete graph with prime power order q, products Cr1&thinsp;&times;&thinsp;Cr2&thinsp;&times;&middot;&middot;&middot;&thinsp;&times;&thinsp;Crk of k cycles of arbitrary lengths, and any power (Cr)s of a cycle of arbitrary length. &copy; 2001 John Wiley & Sons, Inc. J Graph Theory 36: 59&ndash;66, 2001
Fixed-threshold SMO for Joint Constraint Learning Algorithm of Structural SVM
Authors: Changki Lee, HyunKi Kim, Myung-Gil Jang
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

In this paper, we describe a fixed-threshold sequential minimal optimization (FSMO) for a joint constraint learning algorithm of structural classification SVM problems. Because FSMO uses the fact that the joint constraint formulation of structural SVM has b=0, FSMO breaks down the quadratic programming (QP) problems of structural SVM into a series of smallest QP problems, each involving only one variable. By using only one variable, FSMO is advantageous in that each QP sub-problem does not need subset selection.
Design of an instructional planner for an intelligent tutorial system using fuzzy methodology and MAS
Authors: R. M. Aguilar, V. Muñoz, E. J. González, C. González, M. A. Noda, A. Bruno, L. Moreno
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

The goal of this paper is to present a Fuzzy Instructional Planner belonging to an Intelligent Tutorial System (ITS) which has been designed as a tool for the reinforcement of the addition operation. We have modeled the uncertainty in the student's knowledge and the teaching strategy by using principles from a rigorous fuzzy logic methodology.
Inundation distances and run-up measurements from ASTER, QuickBird and SRTM data, Aceh coast, Indonesia
Authors: B. G. McAdoo, N. Richardson, J. Borrero
Venue: International Journal of Remote Sensing (2007)

The massive 26 December 2004 earthquake and tsunami affected a large geographic region in the Indian Ocean basin, hitting Indonesia's Aceh province on the island of Sumatra particularly hard. In this study, tsunami inundation distances and run-up elevations on the NW Sumatran coast are assessed at a regional scale using remotely sensed data (ASTER, QuickBird and SRTM). Using satellite data in disaster zones allows tsunami scientists to access data in difficult areas (logistically and politically), along with the other benefits that such data has to offer (e.g. spectral and spatial). Field work rapidly following the tsunami allowed the collection of samples, elevation data and other information through interviews with survivors that validated the remotely sensed observations. Median run-up elevations extracted from SRTM and ASTER generated digital elevation models (DEMs) for the Banda Aceh area were 16 m and 9.7 m above sea level respectively, and field measurements averaged 9 m. In Meulaboh, median run-up elevations were 9 m (SRTM) and 6.6 m (ASTER) which are close to the 10-15 m range determined in the field. Run-up elevations at Jantang have a bimodal distribution with peaks that correspond to inundation limits in the floodplains (∼10 m in both the SRTM and ASTER data) and cliffs (32 m in the ASTER and less well-defined in the SRTM data). Slope maps generated from SRTM and ASTER DEMs show that the inundation limit rarely exceeds slopes of 4°. Using the Aceh area as a control, SRTM and ASTER data and the range of possible products derived from them is here taken as potential suitable tool for computer inundation models that aid in evacuation planning.
Service Automation and Dynamic Provisioning Techniques in IP/MPLS Environments (Wiley Series on Communications Networking & Distributed Systems), 1 edition
Authors: Christian Jacquenet, Mohamed Boucadair, Gilles Bourdon
Venue:  (2008)

Save time & resources with this comprehensive guide to automation configuration for the value-added IP services of the future. As the Internet becomes the medium of choice for value-added IP service offerings such as TV broadcasting, videoconferencing, and Voice over IP, the ability of automating configuration processes has become a key challenge for service providers. In fact, this feature has become crucial with the ever-growing level of expertise required to deploy such services and the scope of the techniques that need to be activated in order to provide such services with a guaranteed level of quality. Service Automation and Dynamic Provisioning Techniques in IP/MPLS Environments: Discusses architectures and protocols for services information, covering the state-of-the-art in current implementations of Remote Authentication Dial-In User Service (RADIUS), Diameter, Common Open Policy Service (COPS), Simple Network Management Protocol (SNMP) and NETCONF Explains various application examples, covering the dynamic enforcement of QoS, security, and IP Traffic Engineering policies. Covers the automated production of MPLS-based VPNs. The authors offer an invaluable guide for IT facilitators, network managers, and researchers in industry and academia, as well as students studying advanced IP/MPLS networking communications courses. System designers and architects will also find this book helpful.
System Verilog for Quality of Results (QoR)
Authors: Ravi Surepeddi
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Design complexity is ever increasing with multi-mode, statistical timing analysis, multi-vt/VDD low power and multi-core performance based type of designs. IEEE 1800 System Verilog (Ref 1) is a natural smooth transition language to Verilog (Ref2 and 3) for system level design and verification. Verilog RTL has been popularly used for many design tape outs. System Verilog (SV) extensive support exists in verification tools viz. simulators, formal for various powerful SV specific design constructs. It is envisaged that SV will be used for design tape outs soon as many design houses started using SV specific RTL constructs for system designs involving high levels of design data abstractions for various design application keeping in view of verification support. This paper analyzes on various SV design specific constructs for design Quality of Results (QOR) improvement. The specific constructs discussed for design QOR improvements are 1) Operator overloading using user defined types to bring in efficient implementation of data path operators like multiplier, adder, shift,.. 2) Parameterized module interface for different sized datapath, memory, fifo, register files.. 3) Configuration to bind a particular efficient architecture to a module based on QOR requirement 4) System level modules interface and arbitration using "interface" construct.5) Multiple clock domain definition and interface.6) IEEE1801 UPF low power design intent flow.
An end-of-life decision support tool for product recovery considerations in the footwear industry
Authors: T. Staikos, S. Rahimifard
Venue: International Journal of Computer Integrated Manufacturing (2007)

The footwear industry is a manufacturing sector that utilizes a wide variety of materials and processes to produce a range of distinctly different products, from sandals to more specialized footwear. Currently, more than 19 billion pairs of shoes are produced worldwide every year. This creates a large waste stream at the end of the functional life of shoes, which are often disposed of in landfills. Producer responsibility concerns, forthcoming legislation and increasingly environmentally conscious consumers are expected to challenge the way the global footwear industry is dealing with its end-of-life (EoL) products. This paper highlights the potential benefits of developing a footwear product recovery methodology and an associated software tool to support decision-making to determine the most suitable (in environmental, economic and social-technical terms) manner in which to treat post-consumer shoe waste. Such a methodology, in addition to supporting design and material selection processes, could also provide benchmark information for the selection of the best EoL practice for a selected range of different shoe types. The paper concludes by providing a computational viewpoint of an EoL shoe recovery decision support tool.
Combinatorial genericity and minimal rigidity
Authors: Ileana Streinu, Louis Theran
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

A well studied geometric problem, with applications ranging from molecular structure determination to sensor networks, asks for the reconstruction of a set P of n unknown points from a finite set of pairwise distances (up to Euclidean isometries). We are concerned here with a related problem: which sets of distances are minimal with the property that they allow for the reconstruction of P, up to a finite set of possibilities? In the planar case, the answer is known generically via the landmark Maxwell-Laman Theorem from Rigidity Theory, and it leads to a combinatorial answer: the underlying structure of such a generic minimal collection of distances is a minimally rigid (or Laman) graph, for which very efficient combinatorial decision algorithms exist. For non-generic cases the situation appears to be dramatically different, with the best known algorithms relying on exponential-time Gröbner base methods, and some specific instances known to be NP-hard. Understanding what makes a point set generic emerges as an intriguing geometric question with practical algorithmic consequences. Several definitions (some but not all equivalent) of genericity appear in the rigidity literature, and they have either a measure theoretic, topologic or algebraic-geometric flavor. Some generic point sets appear to be highly degenerate, and still turn out to be generic. All existing proofs of Laman's Theorem make use at some point of one or another of these geometric genericity assumptions. The main result of this paper is the first purely combinatorial proof of Laman's theorem, together with some interesting consequences. Genericity is characterized in terms of a certain determinant being not identically-zero as a formal polynomial. We relate its monomial expansion to certain colorings and orientations of the graph and show that these terms cannot all cancel exactly when the underlying graph is Laman. As a surprising consequence, genericity emerges as a purely combinatorial concept.
Comparison of the scaling characteristics of nanoscale SOI N-channel multiple-gate MOSFETs
Authors: Aniket A. Breed, Kenneth P. Roenker
Venue: Analog Integrated Circuits and Signal Processing (2008)

As MOSFET scaling pushes channel lengths below 65 nm, device designs utilizing fully depleted silicon-on-insulator (SOI) technology and employing two or more gates are becoming increasingly attractive as a means to counteract short channel effects. The presence of multiple gates enhances the total control that the gate exercises on the channel region and the SOI technology allows for a significant reduction in the junction capacitance. In combination, these two factors result in devices that exhibit superior characteristics to the conventional planar MOSFET. This paper compares the variation in the switching performance of the three leading multi-gate MOSFET designs, namely the FinFET, TriGate, and Omega-gate. A 3-dimensional, commercial numerical device simulator is employed to investigate the device characteristics using a common set of material parameters, device physics models, and performance metrics. Examined initially are the short-channel effects including the subthreshold slope (S) and the drain-induced barrier lowering as the gate length is scaled down to 20 nm. Subsequently investigated and compared are the effects of scaling of the fin's body width and height, the oxide thickness, and channel doping. The investigation reveals that the Omega-gate MOSFET shows the best scaling characteristics at a particular device dimension with the TriGate device showing the least variation in characteristics as device dimensions vary.
Power to the people: securing the internet one edge at a time
Authors: Soon Hin Khor, Nicolas Christin, Tina Wong, Akihiro Nakao
Venue: Proceedings of the 2007 workshop on Large scale attack defense (2007)

Despite a plethora of research in the area, none of the mechanisms proposed so far for Denial-of-Service (DoS) mitigation has been widely deployed. We argue in this paper that these deployment difficulties are primarily due to economic inefficiency, rather than to technical shortcomings of the proposed DoS-resilient technologies. We identify economic phenomena, negative externality---the benefit derived from adopting a technology depends on the action of others---and economic incentive misalignment---the party who suffers from an economic loss is different from the party who is in the best position to prevent that loss---as the main stumbling blocks of adoption. Our main contribution is a novel DoS mitigation architecture, Burrows, with an economic incentive realignment property. Burrows is obtained by re-factoring existing key DoS mitigation technologies, and can increase the "social welfare," i.e., economic benefit, of the entire Internet community---both infrastructure providers and the Internet users. At the core of Burrows is a wide-area virtual private network, or secure overlay, carved out of the existing Internet. Entry points into the Burrows overlay are controlled by gateways, which in addition to providing connectivity, minimize negative externality flowing between Burrows and the Internet. To rectify the aforementioned economic incentive misalignment, the power to realize Burrows is put into the hands of the Internet users. In addition, Burrows supports incremental deployment: even with as few as two participants, Burrows provides an environment more secure than without it.
Building Multiobjective Resilient Networks
Authors: Crina Grosan, Ajith Abraham, Bjarne E. Helvik
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The paper deals with the design of resilient networks that are fault tolerant against link failures. Usually, fault tolerance is achieved by providing backup paths, which are used in case of an edge failure on a primary path. We consider this task as a multiobjective optimization problem: to provide resilience in networks while minimizing the cost subject to capacity constraint. We propose a stochastic approach, which can generate multiple Pareto solutions in a single run. The feasibility of the proposed method is illustrated by considering two network design problems.
Modeling and Verification of Time-Triggered Communication Protocols
Authors: Maria Sorea, Bruno Dutertre, Wilfried Steiner
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

We give an introduction and survey of a formal modeling and verification approach that has been successfully applied to time-triggered protocols. This method allows us to capture and reason about real-time properties of distributed systems. It relies on the modeling concept of calendar similar to what has been used for a long time in discrete event simulation. It is also supported by efficient symbolic verification tools provided by the SAL environment. We present the basis of the modeling method and discuss two related verification approaches for analyzing complex, real-time distributed systems.
Cross-lingual audio-to-text alignment for multimedia content management
Authors: Dau-Cheng Lyu, Ren-Yuan Lyu, Yuang-Chin Chiang, Chun-Nan Hsu
Venue: Decision Support Systems (2008)

This paper addresses a content management problem in situations where we have a collection of spoken documents in audio stream format in one language and a collection of related text documents in another. In our case, we have a huge digital archive of audio broadcast news in Taiwanese, but its transcriptions are unavailable. Meanwhile, we have a collection of related text-based news stories, but they are written in Chinese characters. Due to the lack of a standard written form for Taiwanese, manual transcription of spoken documents is prohibitively expensive, and automatic transcription by speech recognition is infeasible because of its poor performance for Taiwanese spontaneous speech. We present an approximate solution by aligning Taiwanese spoken documents with related text documents in Mandarin. The idea is to take advantage of the abundance of Mandarin text documents available in our application to compensate for the limitations of speech recognition systems. Experimental results show that even though our speech recognizer for spontaneous Taiwanese performs poorly, our approach still achieve a high (82.5%) alignment accuracy for sufficient for content management.
Nanofabrication of SiC templates for direct hot embossing for metallic photonic structures and meta materials
Authors: Yifang Chen, Yun Zhou, Genhua Pan, Ejaz Huq, Bing-Rui Lu, Shen-Qi Xie, Jing Wan, Zhen Shu, Xin-Ping Qu, Ran Liu, S. Banu, S. Birtwell, Liudi Jiang
Venue: Microelectronic Engineering (2008)

A reliable nanofabrication process for hard templates in SiC amorphous film was developed. The process involves high resolution electron beam lithography and reactive ion etch for nanosize structures in SiC. Study of the RIE property in SiC narrow trenches and dot array indicates that various profiles of sidewall can be achieved by controlling the etch power and ratio of fluorine-based gas mixture. It was also discovered that SiC material is RIE lag free in dry etch, which opens up a broader applications for deep and narrow structures. Applications of SiC templates for hot embossing into metals and plastics prove that the SiC templates formed in amorphous film are hard enough for the fabrications of metallic photonic structures and meta materials.
Some convex programs without a duality gap
Authors: Paul Tseng
Venue: Mathematical Programming: Series A and B (2008)

An important issue in convex programming concerns duality gap. Various conditions have been developed over the years that guarantee no duality gap, including one developed by Rockafellar (Network flows and monotropic programming. Wiley-Interscience, New York, 1984)involving separable objective function and affine constraints. We show that this sufficient condition can be further relaxed to allow the constraint functions to be separable. We also refine a sufficient condition involving weakly analytic functions by allowing them to be extended-real-valued.
Output feedback receding horizon stabilization and H∞ control for time-varying discrete-time systems
Authors: HItoshi Katayama, Akira Ichikawa
Venue: International Journal of Systems Science (2007)

In this paper we consider the receding horizon stabilization and H∞ control problems for time-varying discrete-time systems. We first consider the receding horizon stabilization control problem. We give design methods of receding horizon state feedback, output feedback controllers and observers. We then consider the receding horizon H∞ control problems. We introduce two Riccati inequalities (equations) from the standard H∞ theory, one for the state feedback controller and the other for the filter gain. We rewrite the second Riccati inequality and obtain an equivalent inequality for the inverse. We then rewrite this using LMI to obtain the final form of the inequality which is used to our receding horizon H∞ control problem. We give a numerical example and construct a receding horizon H∞ controller.
A collaborative guidance case study
Authors: Duncan Stevenson, Jane Li, Jocelyn Smith, Matthew Hutchins
Venue: Proceedings of the ninth conference on Australasian user interface - Volume 76 (2008)

This paper reports on a collaborative guidance case study, which investigated the use of remote pointing and drawing technologies in a system designed for spatially focussed collaborative tasks. Four guidance technologies were available to the participants -- pointing and drawing over video of the remote site and pointing and drawing into the remote workplace itself. The experimental task was designed to mimic the actions observed in an actual application setting. The purpose of the study was to see how the participants would use the technology and how they would collaborate with each other during the performance of the task. Specifically, the experiment looked at how the participants selected from the choice of guidance technology, and changed their selection, as the task progressed. It looked at how they used the technology and how they created working, 3-dimensional, shared frames of reference for the task. Finally it explored the way the system supported emerging collaborative behaviour between each pair of participants. The paper concludes that the participants were able to make reasoned choices about their selection of guidance technology, and that they evolved effective guidance strategies as the task progressed. They adapted their understanding of each other's frame of reference with respect to the task by focusing on reference objects created during the task. Finally, the paper concludes that the experimental system did indeed foster emerging collaborative behaviour between the participants.
Comparative Study of Particle Swarm Approaches for the Prediction of Functionally Important Residues in Protein Structures
Authors: Hiram Firpi, Eunseog Youn, Sean Mooney
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Prediction of functionally important amino acids in protein structures is challenging problem in the area of protein function prediction. In the quest of looking for better machine learning approaches to address this problem, we have compared a support vector machine and a neural network trained with a particle swarm algorithm (PSO) to nonlinearly combine a subset of features selected from a set of 314 features describing catalytic residues in protein structures. We compare this approach against three other approaches. Results show trade-offs for two of the approaches on the precision-recall curves. While no approach surpassed the performance of the linear kernel support vector machine (SVM) classifier, the performance of the PSO was comparable to that of a feature selected SVM.
Towards a conceptual framework and tool support for linking long-term product and business planning with agile software development
Authors: Jarno Vähäniitty, Kristian T. Rautiainen
Venue: Proceedings of the 1st international workshop on Software development governance (2008)

For a software company it is essential to understand how to link business management and software development decision-making. Agile methods adhere to the viewpoint of individual development projects, leaving business concerns such as long-term product and release planning and multi-project management mostly unaddressed. With poorly governed fast-paced development, the big picture of the ongoing work and its link to the company's overall business goals and strategy may become unclear. The difficulties in linking business and development are also reflected in current project management/issue tracking tool support. In this paper we present a conceptual framework of the links between long-term business, product and release planning and agile software development. The framework aims to provide a common language through which the big picture of software development - including needed roles, responsibilities and decision structures - can be analyzed, communicated and discussed. We also present Agilefant, a proof-of-concept tool based on the framework.