ppxscal/embedding_network huggingface dataset:
Proceedings of the 45th annual Design Automation Conference
Venue: Annual ACM IEEE Design Automation Conference (2008)

Welcome to the 45th Design Automation Conference and the City of Anaheim! DAC is the premier event for the electronic design community. It offers the industry's most prestigious technical conference in combination with the biggest exhibition. DAC is also increasingly the meeting place for many related organizations --- the conference this year has attracted a record number of additional events. In particular, 14 workshops and seven collocated events are taking place during DAC. We are privileged to have as guest speakers, the ACM Turing Award winners, who have been recognized with the highest honor in the area of computing for their role in developing Model-checking into a highly effective verification technology, widely adopted in the hardware and software industries: Edmund M. Clarke, FORE Systems Professor, Carnegie Mellon University, E. Allen Emerson, Endowed Professor, University of Texas at Austin and Joseph Sifakis, CNRS Research Director, Verimag. DAC is proud to present outstanding industry leaders in three keynote presentations. On Tuesday, Justin R. Rattner, Intel Senior Fellow, Vice President, Director, Corporate Technology Group and Chief Technology Officer, Intel Corp., will re-examine radio architecture and describe the expected shift from largely analog to nearly pure digital and programmable multi-radios design. On Wednesday, Sanjay K. Jha, Chief Operating Officer, Qualcomm and President, Qualcomm CDMA Technologies, will present the design challenges of advanced wireless silicon systems. His talk will focus on how partnering companies need to collaborate to tackle complex design issues through synergistic groups. On Thursday, Jack Little, President, and Co-founder of The MathWorks, Inc., will discuss the emerging workflow from idea to system implementation. Such a design flow will provide great value to companies that develop embedded systems and electronics. DAC's 82 member Technical Program Committee selected 147 papers for this year's technical program from a pool of 639 submissions. Highlighted topics this year are Business, Design Methodologies, System Level and Embedded Design, Interconnect and Reliability, Synthesis and FPGA, Low Power, Multi-core, Wireless, Physical Design, DFM and the Manufacturing Interface, Analog/Mixed Signal/RF and Simulation, Verification and Test, Strictly Design and New and Emerging Technologies. The program also includes eight Panels, eight Special Sessions, six Tutorials and six Hands-on Tutorials, Management Day and WACI ("Wild and Crazy Ideas"). DAC's exhibition features over 225 companies and includes 20 exciting Pavilion Panels. New this year are DAC's iDesign sessions, the DACeZine newsletter, the YouTube preview of the technical program, the Exhibitor Forum that offers a series of technical presentations from exhibitors, and the Best of DAC Contest, which invites you to vote for your favorite products and vendors.
3-Coloring graphs embedded in surfaces
Authors: Yue Zhao
Venue: Journal of Graph Theory (2000)

In this article, we show that there exists an integer k(&Sigma;) &ge; 5 such that, if G is a graph embedded in a surface &Sigma; without i-circuits, 4 &le; i &le; k(&Sigma;), then G is 3-colorable. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 33: 140143, 2000
Technical communique: Robust state prediction for descriptor systems
Authors: João Y. Ishihara, Marco H. Terra
Venue: Automatica (Journal of IFAC) (2008)

This paper deals with the problem of state prediction for descriptor systems subject to bounded uncertainties. The problem is stated in terms of the optimization of an appropriate quadratic functional. This functional is well suited to derive not only the robust predictor for descriptor systems but also that for usual state-space systems. Numerical examples are included in order to demonstrate the performance of this new filter.
A micromagnetoflowcell for microfluidic measurements
Authors: C. S. Lo, P. D. Prewett, G. J. Davies, J. Bowen, K. Vanner
Venue: Microelectronic Engineering (2008)

An experimental micromagnetoflowcell viscometer was fabricated to enable viscosity measurements for microscopic quantities of liquid. The device measures the terminal velocity of superparamagnetic microparticles to determine the fluid properties. The motion of these particles is controlled by the magnetic fields generated from microscopic electromagnetic loops. Initial experiments have been conducted for different fluids, using high speed video microscopy. The results are consistent with viscosity differences and have established proof of principle for the device.
Adoption of technology-mediated learning in the U.S.
Authors: Zafer D. Ozdemir, Kemal Altınkemer, John M. Barron
Venue: Decision Support Systems (2008)

Technology-mediated learning (TML) has been a growing trend among higher education institutions in the U.S., especially after the inception of e-commerce. In this paper, we develop an analytical framework that focuses on the relationship between the extent of TML adoption and students' return from a higher education degree. This framework is used to derive hypotheses about how adoption levels should vary based on the institutional and student characteristics of a university. Using an extensive data set for the 2000-2001 academic year, our empirical work supports hypotheses concerning the importance of the quality and location of institutions as well as students' time value on the TML adoption decision. Specifically, we find that TML is used more in lower-ranked universities, in states with high population densities, and at the graduate than the undergraduate level. These results provide insights on the kind of institutions and program offerings that stand to gain the most from adopting TML.
Pseudospectral integration matrix and boundary value problems
Authors: Elsayed M. E. Elbarbary
Venue: International Journal of Computer Mathematics (2007)

This paper presents a new spectral successive integration matrix. This matrix is used to construct a Chebyshev expansion method for the solution of boundary value problems. The method employs the pseudospectral approximation of the highest-order derivative to generate an approximation to the lower-order derivatives. Application to the linear stability problem for plane Poiseuille flow is presented. The present numerical results are in satisfactory agreement with the exact solutions.
A Modeling Method for ISP Topologies Based on Network-Cost Optimization
Authors: Naoto Hidaka, Shin'ichi Arakawa, Masayuki Murata
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

Measurement studies of Internet topologies show that the degree distribution of the topologies exhibits the powerlaw attribute. However, it is apparent that only degree distributions do not determine the structure of ISP topologies, where ISP designs router-level topologies based on their own design policies. Other structural properties rather than degree distribution are important to generate realistic Internet topologies. In this paper, we propose a modeling method for generating realistic ISP Internet topologies that obey the power-law degree distribution and have similar structural properties observed in the measurement studies. Our modeling method adds nodes one by one, and each node connects to optimal nodes in terms of minimizing the overall network-cost. Then, we try to answer a following question: what design factors are important to form realistic Internet topologies? Our results show that node locations and traffic demands are important to form the realistic Internet topologies.
Augmented Lagrangians in semi-infinite programming
Authors: Jan-J. R&#x00fc;ckmann, Alexander Shapiro
Venue: Mathematical Programming: Series A and B (2008)

We consider the class of semi-infinite programming problems which became in recent years a powerful tool for the mathematical modeling of many real-life problems. In this paper, we study an augmented Lagrangian approach to semi-infinite problems and present necessary and sufficient conditions for the existence of corresponding augmented Lagrange multipliers. Furthermore, we discuss two particular cases for the augmenting function: the proximal Lagrangian and the sharp Lagrangian.
A tribute, not a memorial: understanding ambiguous loss
Authors: Pauline Boss
Venue: ACM SIGMOD Record (2008)

In this paper, I discuss ambiguous loss, why it is so traumatizing, what to do to lower the distress when someone disappears without a trace, and why a tribute is more appropriate than a memorial. The paper is dedicated to the family, friends, and colleagues of Jim Gray.
Explaining Classifications For Individual Instances
Authors: Marko Robnik-Šikonja, Igor Kononenko
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

We present a method for explaining predictions for individual instances. The presented approach is general and can be used with all classification models that output probabilities. It is based on decomposition of a model's predictions on individual contributions of each attribute. Our method works for so called black box models such as support vector machines, neural networks, and nearest neighbor algorithms as well as for ensemble methods, such as boosting and random forests. We demonstrate that the generated explanations closely follow the learned models and present a visualization technique which shows the utility of our approach and enables the comparison of different prediction methods.
Flicker: an execution infrastructure for tcb minimization
Authors: Jonathan M. McCune, Bryan J. Parno, Adrian Perrig, Michael K. Reiter, Hiroshi Isozaki
Venue: Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008 (2008)

We present Flicker, an infrastructure for executing security-sensitive code in complete isolation while trusting as few as 250 lines of additional code. Flicker can also provide meaningful, fine-grained attestation of the code executed (as well as its inputs and outputs) to a remote party. Flicker guarantees these properties even if the BIOS, OS and DMA-enabled devices are all malicious. Flicker leverages new commodity processors from AMD and Intel and does not require a new OS or VMM. We demonstrate a full implementation of Flicker on an AMD platform and describe our development environment for simplifying the construction of Flicker-enabled code.
A low phase noise fully integrated 2-GHz CMOS LC VCO design
Authors: Weixin Kong, H. C. Lin
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

This paper describes the design and analysis of a fully integrated CMOS Voltage Controlled Oscillators (VCO). The VCO is designed in TSMC 0.25µm single-poly, 5-metal CMOS process. It is designed to have a tuning range greater than 15% covering the frequency bands of WLAN 802.11b while consuming less than 7 mW of power. A generalized linear phase noise model is developed to predict VCO performance from circuit parameters. The model is used to optimize phase noise under power consumption constraint. The final VCO design achieves a low phase noise of-126 dBc/Hz at 1 MHz offset from carrier.
Land cover mapping using triangular-norms
Authors: Shaheera Rashwan, M. A. Ismail, Soheir Fouad
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

To acquire detection performance required for an operational system in the detection for satellite image for environmental changes, it is necessary to use multiple images over years to know the environmental changes over years. This paper describes a method for decision-level fusion technique where the fusion can compensate for correlation among images. The fusion is done using possibilistic combiners based on T-norms families that better represent the correlation of images. This technique was applied to satellite images for free vegetation of Africa (1998 April 01, 1998 September 01). The performance of this technique, compared to the other techniques such as naïve Bayes, Dempster-Shafer, voting, rule-based and linear discriminant, is evaluated by simple theoretical models.
Extraction of complex index terms in non-English IR: A shallow parsing based approach
Authors: Jesús Vilares, Miguel A. Alonso, Manuel Vilares
Venue: Information Processing and Management: an International Journal (2008)

The performance of information retrieval systems is limited by the linguistic variation present in natural language texts. Word-level natural language processing techniques have been shown to be useful in reducing this variation. In this article, we summarize our work on the extension of these techniques for dealing with phrase-level variation in European languages, taking Spanish as a case in point. We propose the use of syntactic dependencies as complex index terms in an attempt to solve the problems deriving from both syntactic and morpho-syntactic variation and, in this way, to obtain more precise index terms. Such dependencies are obtained through a shallow parser based on cascades of finite-state transducers in order to reduce as far as possible the overhead due to this parsing process. The use of different sources of syntactic information, queries or documents, has been also studied, as has the restriction of the dependencies applied to those obtained from noun phrases. Our approaches have been tested using the CLEF corpus, obtaining consistent improvements with regard to classical word-level non-linguistic techniques. Results show, on the one hand, that syntactic information extracted from documents is more useful than that from queries. On the other hand, it has been demonstrated that by restricting dependencies to those corresponding to noun phrases, important reductions of storage and management costs can be achieved, albeit at the expense of a slight reduction in performance.
Statistical power supply dynamic noise prediction in hierarchical power grid and package networks
Authors: M. Graziano, G. Piccinini
Venue: Integration, the VLSI Journal (2008)

One of the most crucial high performance systems-on-chip design challenge is to front their power supply noise sufferance due to high frequencies, huge number of functional blocks and technology scaling down. Marking a difference from traditional post physical-design static voltage drop analysis, a priori dynamic voltage drop evaluation is the focus of this work. It takes into account transient currents and on-chip and package RLC parasitics while exploring the power grid design solution space: Design countermeasures can be thus early defined and long post physical-design verification cycles can be shortened. As shown by an extensive set of results, a carefully extracted and modular grid library assures realistic evaluation of parasitics impact on noise and facilitates the power network construction; furthermore statistical analysis guarantees a correct current envelope evaluation and Spice simulations endorse reliable results.
To Share or Not to Share Storage in Mesh Networks: A System Throughput Perspective
Authors: Shahram Ghandeharizadeh, Shahin Shayandeh, Tooraj Helmi
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

While the cost per megabyte of storage is economical, sharing storage might be expensive because delivery of a clip occupying the shared storage requires bandwidth. This is especially true for mesh networks where devices are constrained by the radio-range and bandwidth of their wireless networking card. Assuming a device, termed a peer, is configured with a mass storage device, it may share either all, a fraction, or none of its storage. When a peerdoes not shares its storage, it stores clips with the objective to enhance a local criterion such as number of clip requests serviced using its mass storage device. When a peer shares its storage, it may store clips to optimize a global metric such as the total number of devices that may display their clips simultaneously, termed system throughput. Using this global metric, we show the followingsurprising result: the throughput of certain mesh networks is enhanced when peers do not share storage. By understanding these tradeoffs, one may design adaptable software to enable a peer to monitor its environment and decide to share or not to share its storage. We demonstrate the feasibility of such a design using a simulation study.
Bipartite Graph for Protein Structure Matching
Authors: Fazilah Othman, Rosni Abdullah, Rosalina Abdul Salam
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Bipartite graph-based matching technique has a powerful ability to give a global and optimized matching result. At the same time, we can take the advantage of graph-based data representation used with the technique. Graph-based representation has the ability to encapsulate the attribute of the objects and also the relationship details among the elements of the compared objects. The combination of graph-based matching technique and graph-based data structure are best applied in protein tertiary structure matching because protein structure has rich information that needs to be handled with care. The main contribution of the paper is (1) to design bipartite graph matching for protein matching and also (2) to incorporate graph-based data structure called ‘reference frame’ originally used in computer vision into bipartite graph matching. The matching result is measured using exponential similarity function.
An automatic human video objects encryption scheme built on stream and block ciphers and based on chaos
Authors: Klimis S. Ntalianis
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

The increasing popularity of multimedia applications creates an increasing need for secure storage and transmission techniques. Especially wireless communications (satellite, mobile, RF), which can be easily intercepted, should be protected by unauthorized persons. Towards this direction several encryption schemes have been proposed in literature, however most of them do not consider regions of interest (video objects - VOs). These regions may need better protection, may be the only regions that need protection, or should be accessed separately according to different privileges. For these reasons in this paper a human video objects encryption system is proposed based on chaos. Initially videoconference/videophone sequences are analyzed and human video objects are automatically extracted using a face and body detection method. Next the pixels of each human video object are properly arranged and the chaotic cipher module is activated to encrypt them. Finally the background area is also encrypted using a different key. The system presents robustness against known cryptanalytic attacks and enables efficient rate control as semantic information is separated from the background.
IRT-item response theory assessment for an adaptive teaching assessment system
Authors: Mansoor Al-A'ali
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Item Response Theory, IRT, is the study of scoring tests and questions based on assumptions concerning the mathematical relationship between examinee's ability (or other hypothesized traits) and questions' responses. Adaptive student tests, which are based on IRT, have many advantages over the conventional tests. The conventional method is used to give the traditional test scoring and estimating IRT questions' parameters. Our estimation of IRT questions' parameters is based on the Least Square method, a well-known statistical method. Our major goal is to minimize the number of questions in the adaptive test to reach the final level of the students by modifying the equation of estimation of student ability level. New factors are considered, namely initial student ability, subject's difficulty, number of exercises covered by the teacher and number of lessons covered by the teacher. Moreover, students' attitudes toward adaptive tests and their results were measured by a questionnaire. Our conventional exam results were compared with adaptive results and used in determining IRT parameters. We had modified the formula of estimating student ability level and had positive results in minimizing the number of questions in adaptive tests.
G-intersection theorems for matchings and other graphs
Authors: J. robert Johnson, John Talbot
Venue: Combinatorics, Probability and Computing (2008)

If G is a graph with vertex set [n] then <inline-graphic mime-subtype="gif" xlink="S0963548308009206_inline1"><alt-text>$\mathcal{A}\subseteq 2^{[n]}$</alt-text></inline-graphic> is G-intersecting if, for all <inline-graphic mime-subtype="gif" xlink="S0963548308009206_inline2"><alt-text>$A,B\in \mathcal{A}$</alt-text></inline-graphic>, either A ∩ B ≠ ∅ or there exist a ∈ A and b ∈ B such that a ~Gb. The question of how large a k-uniform G-intersecting family can be was first considered by Bohman, Frieze, Ruszinkó and Thoma [2], who identified two natural candidates for the extrema depending on the relative sizes of k and n and asked whether there is a sharp phase transition between the two. Our first result shows that there is a sharp transition and characterizes the extremal families when G is a matching. We also give an example demonstrating that other extremal families can occur. Our second result gives a sufficient condition for the largest G-intersecting family to contain almost all k-sets. In particular we show that if Cn is the n-cycle and k > αn + o(n), where α = 0.266. . . is the smallest positive root of (1 − x)3(1 + x) = 1/2, then the largest Cn-intersecting family has size <inline-graphic mime-subtype="gif" xlink="S0963548308009206_inline3"><alt-text>$(1-o(1))\binom{n}{k}$</alt-text></inline-graphic>. Finally we consider the non-uniform problem, and show that in this case the size of the largest G-intersecting family depends on the matching number of G.
Numerical Methods for Reachable Space Generation of Humanoid Robots
Authors: Yisheng Guan, Kazuhito Yokoi, Xianmin Zhang
Venue: International Journal of Robotics Research (2008)

In view of the importance of workspace to robotic design, motion planning and control, we study humanoid reachable spaces. Due to the large number of degrees of freedom, the complexity and special characteristics of humanoid robots that conventional robots do not possess, it would be very difficult or impractical to use analytical or geometric methods to analyze and obtain humanoid reachable spaces. In this paper, we develop two numerical approaches &#x2014; the optimization-based method and the Monte Carlo method &#x2014; to generate the reachable space of a humanoid robot. We first formulate the basic constraints (including kinematic constraint and balance constraint) that a humanoid robot must satisfy in manipulation tasks. We then use optimization techniques to build mathematical models for boundary points by which the reachable boundary is formed. This method gives rise to an approximation of the reachable space with accurate boundary points. On the other hand, the Monte Carlo method is relatively simple and more suitable for the visualization of robotic workspace. To utilize the numerical results by the Monte Carlo method, we propose an approach to build a database. We present the algorithms with these two methods and provide illustrating examples conducted on the humanoid HRP-2.