ppxscal/embedding_network huggingface dataset:
Efficient algorithm for the computation of on-chip capacitance sensitivities with respect to a large set of parameters
Authors: Tarek El-Moselhy, I. M. Elfadel, David Widiger
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Recent CAD methodologies of Design-for-Manufacturability (DFM) have naturally led to a significant increase in the number of process and layout parameters that have to be taken into account in design-rule checking. Methodological consistency requires that a similar number of parameters be taken into account during layout parasitic extraction. Because of the inherent variability of these parameters, the issue of efficiently extracting deterministic parasitic sensitivities with respect to such a large number of parameters must be addressed. In this paper, we tackle this very issue in the context of capacitance sensitivity extraction. In particular, we show how the adjoint sensitivity method can be efficiently integrated within a finite-difference (FD) scheme to compute the sensitivity of the capacitance with respect to a large set of BEOL parameters. If np is the number of parameters, the speedup of the adjoint method is shown to be a factor of np/2 with respect to direct FD sensitivity techniques. The proposed method has been implemented and verified on a 65nm BEOL cross section having 10 metal layers and a total number of 59 parameters. Because of its speed, the method can be advantageously used to prune out of the CAD flow those BEOL parameters that yield a capacitance sensitivity less than a given threshold.
An ILP for the metro-line crossing problem
Authors: Matthew Asquith, Joachim Gudmundsson, Damian Merrick
Venue: Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77 (2008)

In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in G (e.g. the train lines), we want to draw the paths along the edges of G such that they cross each other as few times as possible. For aesthetic reasons we insist that the relative order of the paths that traverse a vertex does not change within the area occupied by the vertex. We prove that the problem, which is known to be NP-hard, can be rewritten as an integer linear program that finds the optimal solution for the problem. In the case when the order of the endpoints of the paths is fixed we prove that the problem can be solved in polynomial time. This improves a recent result by Bekos et al. (2007).
Optimal query complexity bounds for finding graphs
Authors: Sung-Soon Choi, Jeong Han Kim
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of vertices while a cross-additive query asks the number of edges crossing between two disjoint sets of vertices. The queries ask sum of weights for the weighted graphs. These types of queries were partially motivated in DNA shotgun sequencing and linkage discovery problem of artificial intelligence. For a given unknown weighted graph G with n vertices, m edges, and a certain mild condition on weights, we prove that there exists a non-adaptive algorithm to find the edges of G using O(m log n / log m) queries of both types provided that m ≥ nε for any constant ε > 0. For an unweighted graph, it is shown that the same bound holds for all range of m. This settles a conjecture of Grebinski [23] for finding an unweighted graph using additive queries. We also consider the problem of finding the Fourier coefficients of a certain class of pseudo-Boolean functions. A similar coin weighing problem is also considered.
Application mapping for chip multiprocessors
Authors: Guangyu Chen, Feihui Li, S. W. Son, M. Kandemir
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

The problem attacked in this paper is one of automatically mapping an application onto a Network-on-Chip (NoC) based chip multiprocessor (CMP) architecture in a locality-aware fashion. The proposed compiler approach has four major steps: task scheduling, processor mapping, data mapping, and packet routing. In the first step, the application code is parallelized and the resulting parallel threads are assigned to virtual processors. The second step implements a virtual processor-to-physical processor mapping. The goal of this mapping is to ensure that the threads that are expected to communicate frequently with each other are assigned to neighboring processors as much as possible. In the third step, data elements are mapped to memories attached to CMP nodes. The main objective of this mapping is to place a given data item into a node which is close to the nodes that access it. The last step of our approach determines the paths (between memories and processors) for data to travel in an energy efficient manner. In this paper, we describe the compiler algorithms we implemented in detail and present an experimental evaluation of the framework. In our evaluation, we test our entire framework as well as the impact of omitting some of its steps. This experimental analysis clearly shows that the proposed framework reduces energy consumption of our applications significantly (27.41% on average over a pure performance oriented application mapping strategy) as a result of improved locality of data accesses.
Efficient approximate leave-one-out cross-validation for kernel logistic regression
Authors: Gavin C. Cawley, Nicola L. Talbot
Venue: Machine Learning (2008)

Kernel logistic regression (KLR) is the kernel learning method best suited to binary pattern recognition problems where estimates of a-posteriori probability of class membership are required. Such problems occur frequently in practical applications, for instance because the operational prior class probabilities or equivalently the relative misclassification costs are variable or unknown at the time of training the model. The model parameters are given by the solution of a convex optimization problem, which may be found via an efficient iteratively re-weighted least squares (IRWLS) procedure. The generalization properties of a kernel logistic regression machine are however governed by a small number of hyper-parameters, the values of which must be determined during the process of model selection. In this paper, we propose a novel model selection strategy for KLR, based on a computationally efficient closed-form approximation of the leave-one-out cross-validation procedure. Results obtained on a variety of synthetic and real-world benchmark datasets are given, demonstrating that the proposed model selection procedure is competitive with a more conventional k-fold cross-validation based approach and also with Gaussian process (GP) classifiers implemented using the Laplace approximation and via the Expectation Propagation (EP) algorithm.
A testbed-based approach to develop layer 3 wireless mesh network protocols
Authors: Kenichi Mase, Yasunori Owada, Hiraku Okada, Tomoaki Imai
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

In this paper, two essential components of the layer 3 WMN, routing and rate-switch control, and initial network formation are discussed. The major part of routing protocol is composed of MANET (Mobile Ad Hoc Network) routing protocol and we have adopted OLSRv2, that is in progress of standardization in IETF MANET WG. Outdoor and indoor WMN testbeds are described to develop these WMN protocols together with some experimental results. A newly developed node prototype for WMNs and a WMN testbed built in rural hill-village areas are described together with some preliminary experimental results.
Online estimation of Image Jacobian Matrix for uncalibrated dynamic hand-eye coordination
Authors: Jianbo Su, Yanjun Zhang, Zhiwei Luo
Venue: International Journal of Systems, Control and Communications (2008)

This paper focuses on three different strategies for online estimation of the Image Jacobian Matrix (IJM) in uncalibrated robotic visual servoing, with the help of different scenarios of system configurations and coordination tasks that are prevalent in current research. The least square estimation method and the constant IJM policy are proposed for monocular visual feedback, while a Kalman filter-based method is proposed for a stereovision system. The PI control law and the optimal control theory are respectively adopted for coordination controllers to suit different control purposes. Extensive simulations and experiments are provided to evaluate performance of the proposed methods.
Communication-optimal maintenance of replicated information
Authors: B. Awerbuch
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

It is shown that keeping track of history allows significant improvements in the realistic model of communication complexity of dynamic network protocols. The communication complexity for solving an arbitrary graph problem is improved from Theta (E) to Theta (V), thus achieving the lower bound. Moreover, O(V) is also the amortized complexity of solving an arbitrary function (not only graph functions) defined on the local inputs of the nodes. As a corollary, it is found that amortized communication complexity, i.e. incremental cost of adapting to a single topology change, can be smaller than the communication complexity of solving the problem from scratch. The first stage in the solution is a communication-optimal maintenance of a spanning tree in a dynamic network. The second stage is the optimal maintenance of replicas of databases. An important example of this task is the problem of updating the description of the network's topology at every node. For this problem the message complexity is improved from O(EV) to Theta (V). The improvement for a general database is even larger if the size of the database is larger than E.
Modeling Group Decision-Making for Collaborative Teams in Enterprises
Authors: George Rigopoulos, Nikolaos V. Karadimas, Alessandra Orsonni
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Multicriteria analysis can be incorporated as a method to model preferences and facilitate decision making within a group of decision makers. In this paper we present a Group Decision Support System model, which utilizes multicriteria analysis to support decisions in a collaborative team. In brief, the model is based on the synthesis of group members’ preferences following an appropriate aggregation procedure. The resulting group preference is used as input for the relevant multicriteria methodology to produce the decision outcome. In this paper we present a variation focusing on classification decisions in group setting. We outline the overall methodology as well as the architecture of a prototype group decision support system and present an application in a financial classification problem.
Uptake of modeling practices in SMES: initial results from an industrial survey
Authors: Christer Thörn, Thomas Gustafsson
Venue: Proceedings of the 2008 international workshop on Models in software engineering (2008)

This paper presents the initial results from a survey conducted among regional small and medium-sized enterprises developing software. The purpose is to form an idea of what practices and means for software modeling that has made it into industry, in particular smaller organizations. The constraints placed on small enterprises when it comes to available resources in terms of time, money, staff, etc. set them apart from the targets of most software modeling efforts, which are larger enterprises. From the answers of the respondents we can draw a tentative conclusion that many SMEs are familiar with a relatively wide range of various modeling methods and notations, but the constraints of small organizations pose high demands on immediate applicability in the organizations.
Automated assumption generation for compositional verification
Authors: Anubhav Gupta, K. L. Mcmillan, Zhaohui Fu
Venue: Formal Methods in System Design (2008)

We describe a method for computing a minimum-state automaton to act as an intermediate assertion in assume-guarantee reasoning, using a sampling approach and a Boolean satisfiability solver. For a set of synthetic benchmarks intended to mimic common situations in hardware verification, this is shown to be significantly more effective than earlier approximate methods based on Angluin's L* algorithm. For many of these benchmarks, this method also outperforms BDD-based model checking and interpolation-based model checking. We also demonstrate how domain knowledge can be incorporated into our algorithm to improve its performance.
Ontology and Context
Authors: Isabel Cafezeiro, Edward Hermann Haeusler, Alexandre Rademaker
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

This paper considers a formal framework to contextualize ontologies and presents a formal algebra to manipulate these entities providing several ways of composing ontologies, contexts or both. The algebra gives theflexibility that is required to model applications where the meaning of an entity depends on environment constraints or where dynamic changes in the environment must be considered.
NVIDIA Tesla: A Unified Graphics and Computing Architecture
Authors: Erik Lindholm, John Nickolls, Stuart Oberman, John Montrym
Venue: IEEE Micro (2008)

To enable flexible, programmable graphics and high-performance computing, NVIDIA has developed the Tesla scalable unified graphics and parallel computing architecture. Its scalable parallel array of processors is massively multithreaded and programmable in C or via graphics APIs.
Model-Based Development of Fault-Tolerant Embedded Software
Authors: Christian Buckl, Alois Knoll, Gerhard Schrott
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

The development processes for classical software and fault-tolerant software differ significantly. Fault-tolerant software is typically embedded within a distributed system consisting of heterogeneous hardware and the software has to deal with diverse sensors and actuators. In many cases even different operating systems are applied within the embedded system. This heterogeneity leads to the fact that classic software engineering approaches cannot be applied. Especially code generators and tools for model based development, like Matlab/Simulink or Scade, concentrate mainly on the functional aspects of the application, the controller function for instance. System level code like communication, process management or fault-tolerance mechanisms are not covered by these tools or are only supported for a limited number of platforms - the combination of hardware,operating system and programming languages. On the other hand there is great need for exactly this kind of code generation. Since safety-critical software typically encapsulates domain expertise, the software is often designed by engineers who are experts in the application domain and not in the domain of safety critical software and real-time systems. Thus modelling tools with extensive code generation abilities concerning the system level are required in addition to the existing tools. The paper describes a code generator architecture designed to enable the extensibility of the code generation ability. The generation process is thereby based on templates solving different aspects of the system. If a platform is not supported the developer can change existing templates or implement new ones.
A Long Interval Method to Identify Regular Monthly Mobile Internet Users
Authors: Toshihiko Yamakami
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The Internet access from mobile handsets is extending its coverage. It increases the importance to analyze mobile Internet use in research communities and industries. To cope with the increased demands on mobile Internet user analysis, the author describes a regularity-oriented service model. In order to capture user regularity, the author performs an exploratory clickstream analysis to identify users with high loyalty. Based on the author's previous experience on the relationship between middle-range visit intervals and revisit ratio in the next month, the author tries to identify hour-scale intervals linked to the high-loyalty-users. The author obtains the result that the users with intervals with 480 minutes and 720 minutes show the high revisit ratio. The author analyzes key time zones for high-loyalty users. This method is applicable to a wide range of applications with clickstream logs. Using the long-interval characteristics, the author discusses a double peak model of sub-day-scale activity behaviors in the case study.
Resonant Recognition Model for Prediction of 'Lead-In Regions' in Proteins
Authors: Mohenish Jaiswal, SR Mahadeva Prasanna, Latha Rangan
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

In this study, the resonant recognition model (RRM), was developed to locate the so called `lead-in regions' or residues that contribute to the creation of the environment that enables proteins to perform their complex functions. The RRM is a physical and mathematical model and provides a significant correlation between spectra of numerical presentation of amino acids and their biological activity. We developed a preliminary model for this purpose and applied it on two well characterized classes of enzymes viz., human proteases and kinases. The results obtained (positions of `lead-in residues' in the primary structure of the proteins) were used in association with the 3D-structure data of the proteins for the purpose of predicting the catalytic residue of the enzyme. Key Words: Catalytic site: lead-in-regions; Protein coding; Resonant recognition model (RRM)
Assisted passive snake-like robots: Conception and dynamic modeling using gibbs–appell method
Authors: Gholamreza Vossoughi, Hodjat Pendar, Zoya Heidari, Saman Mohammadi
Venue: Robotica (2008)

In this paper, we present a novel structure of a snake-like robot. This structure enables passive locomotion in snake-like robots. Dynamic equations are obtained for motion in a horizontal plane, using Gibbs–Appell method. Kinematic model of the robot include numerous nonholonomic constraints, which can be omitted at the beginning by choosing proper coordinates to describe the model in Gibbs–Appell framework. In such a case, dynamic equations will be significantly simplified, resulting in considerable reduction of simulation time. Simulation results show that, by proper selection of initial conditions, joint angles operate in a limit cycle and robot can locomote steadily on a passive trajectory. It can be seen that the passive trajectory is approximately a Serpenoid curve.
Wikipedia Mining for Huge Scale Japanese Association Thesaurus Construction
Authors: Kotaro Nakayama, Masahiro Ito, Takahiro Hara, Shojiro Nishio
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Wikipedia, a huge scale Web-based dictionary, is an impressive corpus for knowledge extraction. We already proved that Wikipedia can be used for constructing an English association thesaurus and our link structure mining method is significantly effective for this aim. However, we want to find out how we can apply this method to other languages and what the requirements, differences and characteristics are. Nowadays, Wikipedia supports more than 250 languages such as English, German, French, Polish and Japanese. Among Asian languages, the Japanese Wikipedia is the largest corpus in Wikipedia. In this research, therefore, we analyzed all Japanese articles in Wikipedia and constructed a huge scale Japanese association thesaurus. After constructing the thesaurus, we realized that it shows several impressive characteristics depending on language and culture.
Variability of fire-induced changes in MODIS surface reflectance by land-cover type in Borneo
Authors: J. Miettinen
Venue: International Journal of Remote Sensing (2007)

This study investigates fire-induced spectral changes detected by the Moderate Resolution Imaging Spectroradiometer (MODIS) in different land-cover types in Borneo. Linear discriminant analysis is used to determine the most powerful band combinations among the MODIS reflective bands for discrimination between burnt and unburnt areas in each land-cover type. The results show that the nature of fire-induced changes is dependent on pre-fire vegetation characteristics in this region. Bands 1 (0.64 µm), 2 (0.86 µm), and 7 (2.14 µm) are found to be the most sensitive bands in land-cover types dominated by green vegetation, and consequently indices or combinations of indices using these three bands are potentially effective for burnt-area detection in the majority of areas. In land-cover types dominated by dry vegetation and soil, MODIS band 5 (1.24 µm) alone showed the greatest statistical separability and could not be significantly improved by any multiband index.
A New MAC Protocol for Avoiding Needless Transmission Deferment Induced by Missed RTS/CTS Handshake
Authors: Daishi Inoue, Tetsuya Shigeyasu, Hiroshi Matsuno, Norihiko Morinaga
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

IEEE802.11DCF employs RTS/CTS (Request To Send/Clear To Send) mechanism for mitigating effect of hidden terminals. The RTS/CTS mechanism sets transmission deferral timer to neighbor terminals by exchanging RTS and CTS between transmitter and receiver. Then, in the case that RTS/CTS exchange succeeds, effect of hidden terminals could be suppressed; otherwise, any neighbor which received RTS and/or CTS defers its new transmission needlessly although DATA packet corresponding to the previous RTS/CTS exchange will not be transmitted. In this paper we propose Cancel CTS procedure in order to cope with the unnecessarily transmission deferment. Results of computer simulation confirms that our method well improves the throughput performance of IEEE802.11DCF.
KNOWLEDGE MANAGEMENT BASED ON FORMAL MODELS OF SOFTWARE PROJECT MANAGEMENT
Authors: Zdzisław Kowalczuk, Cezary Orłowski
Venue: Cybernetics and Systems (2007)

The objective of this paper is to present a complete conception of decision support systems for software project management. The idea is founded on dynamic and self-adjusting fuzzy models. Specifically, the propsed approach is founded on the knowledge-based methodology and the theories of dynamic systems and fuzzy sets. The presented method can be used in manufacturing of knowledge-based Information Technology (IT) products. A preliminary design of a fuzzy model can take advantage of experience from managing projects. Relevant experimental data resulting from such projects can then be utilized for adjusting the membership functions of the fuzzy model applied in the knowledge-based decistion-support system.