ppxscal/embedding_network huggingface dataset:
Behavioral model generation of analog circuits
Authors: Mihai Iordache, Lucia Dumitriu
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

Behavioral models are used for top-down design and for bottom-up verification. The efficient simulation of large-scale dynamical system needs a systematic procedure for order reduction of the original circuit. A method based on the moment matching for behavioral model generation of analog integrated circuits and by comparison some approaches to obtain an accurate approximation of the circuit function are presented. It is shown that we can handle the MIMO system using the semi-state method and Padé approximation. An illustrative example is given and some conclusions are pointed out.
Politics in Play
Authors: David Alan Grier
Venue: Computer (2009)

Building an adaptive power grid requires cooperation, getting a common agreement among a large collection of engineers, investors, policy makers, corporate executives, and voters.
Energy-efficient clustering for ad-hoc transmission in wireless sensor networks
Authors: Gurpreet Singh, Rashmi Gupta, Gaoxi Xiao
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Clustering in wireless sensor networks is a widely acclaimed and proven energy-saving scheme. By letting each sensor to communicate with its cluster-head (CH), which in turn aggregates the collected information and communicates to the base station (BS), energy consumptions can be lowered. In this paper, we propose a set of simple yet effective algorithms for minimizing the overall energy consumptions in clustered wireless sensor networks where each CH can either communicate directly to BS or ad-hoc through other CHs. Simulation results show that, by allowing ad-hoc transmissions between CHs, an impressive energy saving can be achieved. Moreover, under such case the networks also tend to have more balanced energy consumptions by different clusters, which is highly favorable in some applications.
Photoshop Elements 6 for Mac Essential Training
Authors: Ted LoCascio
Venue:  (2008)

In Photoshop Elements 6 for Mac Essential Training, Ted LoCascio teaches casual photographers how to organize, edit, and share their digital image libraries using this powerful software package from Adobe. He tours the included Adobe Bridge application, used for importing and organizing photographs, and explores every feature of Elements itself. He demonstrates how to navigate the Elements workspace, which is used to correct and improve images, combine them into projects, and produce slideshows, photo books, web galleries, and more. Ted also explains how to get the most out of each editing mode, and shares tips for correcting, retouching, and sharpening photographs. Example files accompany the course. Topics Include: Identifying photos by name, keyword, rating, and label Locating photos with searches, filters, collections, and stacks Using automated red-eye correction and sharpening tools Making detailed color and tone corrections Using Photomerge on faces and groups Working with filters, artwork, and other image customizations Scrapbooking Duration: 8.5 hoursOn 1 DVD-ROM System Requirements Macintosh Requirements OS 10.3.9 or higher DVD-ROM drive 1024x768 resolution 24-bit video support QuickTime 7 or higher Windows Requirements XP or Vista DVD-ROM Drive 1024x768 resolution 24-bit video support PC sound card/speakers QuickTime 7 or higher (included) .NET 2.0 or higher (included)
Virtual reality prototype for measurement of expression characteristics in emotional situations
Authors: Kiwan Han, Jeonghun Ku, Kwanguk Kim, Hee Jeong Jang, Junyoung Park, Jae-Jin Kim, Chan Hyung Kim, Min-Hyung Choi, In Young Kim, Sun I. Kim
Venue: Computers in Biology and Medicine (2009)

Expressions are a basic necessity for daily living, as they are required for managing relationships with other people. Conventional expression training has difficulty achieving an objective measurement, because their assessment depends on the therapist's ability to assess a patient's state or training effectiveness. In addition, it is difficult to provide emotional and social situations in the same manner for each training or assessment session. Virtual reality techniques can overcome shortcomings occurring in conventional studies by providing exact and objective measurements and emotional and social situations. In this study, we developed a virtual reality prototype that could present emotional situation and measure expression characteristics. Although this is a preliminary study, it could be considered that this study shows the potential of virtual reality as an assessment tool.
Consensus-based evaluation framework for distributed information retrieval systems
Authors: Jason J. Jung
Venue: Knowledge and Information Systems (2009)

Multi-agent systems have been attacking the challenges of information retrieval tasks on distributed environment. In this paper, we propose a consensus choice selection method based framework to evaluate the performance of cooperative information retrieval tasks of the multiple agents. Thereby, two well-known measurements, precision and recall, are extended to handle consensual closeness (i.e., local and global consensus) between the sets of retrieved results. We show that in a motivating example the proposed criteria are prone to solve the rigidity problem of classical precision and recall. More importantly, the retrieved results can be ranked with respect to the consensual score, and the ranking mechanism has been verified to be more reasonable.
From Extensity to Protensity in CAS: Adding Sounds to Icons
Authors: Alina E. Lascu, Alexandru V. Georgescu
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

Being aware of the gap between technological offers and user expectations, the paper aims to illustrate the necessity of anthropocentric designs ("user-pulled") and to reveal the dangers of current ICT designs ("technology-pushed"). Since the gap is deepened because of insufficient innovative use of new agent-oriented technology potential, an affordable manner to "invent new Computer-Aided x" application domains is proposed. To substantiate the approach, the domain must be challenging, easy to implement and "as humanist as possible": Computer-Aided Semiosis (CAS). On this background, the paper also presents a new and challenging concept in IT applied research, borrowed from psychology and meant to assist the process of semiosis: protensity. If the prior researches focused on images and implicitly on extensity (i.e. extensity versus image-based messages; protensity versus sound-based messages), the idea is to extend CAS through innovative attributes, in line with music-oriented user expectations. Thus, the paper refers a newcomer in agent-oriented technology: the Protensional Agents (i.e. interface agents represented on the screen as pseudo-avatars). The paper concludes that CAS is a pathfinder for other researches in this field and the concept of CAS could be used for immediate applied research. Moreover Smart DJ is a good example also for the applicability of CAS in the field of protensity-based messages.
Symbolic Computation of an Exact Solution of the Cauchy Problem for the System of Crystal Optics with Polynomial Data
Authors: Valery Yakhno, Meltem Altunkaynak
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

A new method for computing explicit formulae of exact solutions of the Cauchy problem for the time-dependent hyperbolic system of crystal optics with polynomials entries is given. This method is based on symbolic computations of all Taylor coefficients for a solution of the Cauchy problem using the initial data and inhomogeneous term which have polynomial presentation with respect to space variables. Computing explicit formulae of solutions is implemented by Maple 10. A computational example is presented.
Exploiting "approximate communication" for mobile media applications
Authors: Sayandeep Sen, Stephen Schmitt, Mason Donahue, Suman Banerjee
Venue: Proceedings of the 10th workshop on Mobile Computing Systems and Applications (2009)

Errors are integral part of every communication system, whether wired or wireless. There are two broad approaches to deal with errors: (i) detection and discard of data elements in error and (ii) optional recovery from such errors either through proactive or reactive (re)-transmissions. Both these approaches assume that errors are binary in nature, i.e., an error in transmission implies a need to discard or recover the erroneous bits. In this paper, we consider an intriguing alternative, one in which data elements in error are accepted as "approximately correct" values. We call this approximate communication. More specifically, we introduce the notion that data elements being received are not just correct or incorrect. Instead, there exists a degree of correctness in the received data elements that can be effectively exploited by certain classes of popular applications operating across mobile communication systems.
Improved Algorithm for a Widest 1-Corner Corridor
Authors: Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

Given a set P of n points on a 2D plane, the 1-corner empty corridor is a region inside the convex hull of P which is bounded by a pair of links; each link is an unbounded trapezium bounded by two parallel half-lines, and it does not contain any point of P. We present an improved algorithm for computing the widest empty 1-corner corridor that runs in O(n 3log2 n) time and O(n 2) space. This improves the time complexity of the best known algorithm for the same problem by a factor of $\frac{n}{\log n}$[4].
Logic Mapping in Crossbar-Based Nanoarchitectures
Authors: Wenjing Rao, Alex Orailoglu, Ramesh Karri
Venue: IEEE Design Test (2009)

This article presents a mathematical model and algorithm that address the problem of logic function mapping in a nanoelectronic environment. Enhancement techniques improve the algorithm's runtime by significantly cutting down on unnecessary backtracking processes.
Energy-aware flash memory management in virtual memory system
Authors: Han-Lin Li, Chia-Lin Yang, Hung-Wei Tseng
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

The traditional virtual memory system is designed for decades assuming a magnetic disk as the secondary storage. Recently, flash memory becomes a popular storage alternative for many portable devices with the continuing improvements on its capacity, reliability and much lower power consumption than mechanical hard drives. The characteristics of flash memory are quite different from a magnetic disk. Therefore, in this paper, we revisit virtual memory system design considering limitations imposed by flash memory. In particular, we focus on the energy efficient aspect since power is the first-order design consideration for embedded systems. Due to the write-once feature of flash memory, frequent writes incur frequent garbage collection thereby introducing significant energy overhead. Therefore, in this paper, we propose three methods to reduce writes to flash memory. The HotCache scheme adds an SRAM cache to buffer frequent writes. The subpaging technique partitions a page into subunits, and only dirty subpages are written to flash memory. The duplication-aware garbage collection method exploits data redundancy between the main memory and flash memory to reduce writes incurred by garbage collection. We also identify one type of data locality that is inherent in accesses to flash memory in the virtual memory system, intrapage locality. Intrapage locality needs to be carefully maintained for data allocation in flash memory. Destroying intrapage locality causes noticeable increases in energy consumption. Experimental results show that the average energy reduction of combined subpaging, HotCache, and duplication-aware garbage collection techniques is 42.2%.
Properties of regular systems and algorithmic improvements for regular decomposition
Authors: Meng Jin
Venue: Computers Mathematics with Applications (2009)

In this paper, we study the properties of regular systems and improve the efficiency of the regular decomposition method RegSer implemented in Epsilon. We define a weaker concept which retains most properties of regular system. It can be shown that from a weak regular system one can also define a regular set and vice versa. We present an algorithm RecurWeakRegSer to decompose a given polynomial system [P,Q] into weak regular systems. When Q
A PSO Based Adaboost Approach to Object Detection
Authors: Ammar W. Mohemmed, Mengjie Zhang, Mark Johnston
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

This paper describes a new approach using particle swarm optimisation (PSO) within AdaBoost for object detection. Instead of using the time consuming exhaustive search for finding good features to be used for constructing weak classifiers in AdaBoost, we propose two PSO based methods in this paper. The first uses PSO to evolve and select the good features only and the weak classifiers use a kind of decision stump. The second uses PSO for both selecting the good features and evolving weak classifiers in parallel. These two methods are examined and compared on a pasta detection data set. The experiment results show that both approaches perform quite well for the pasta detection problem, and that using PSO for selecting good individual features and evolving associated weak classifiers in AdaBoost is more effective than for selecting features only for this problem.
Certification of computing personnel: prospects and potential impact
Authors: Fred H. Harris, Robert N. Reinstedt, Donn B. Parker, William J. Horne, H. R. J. Grosch
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Sociologists have identified key attributes of professionalism by studying vocations which are widely recognized as professions. These include, among others, a high standard of skill and knowledge; public reliance upon the standards of its practitioners, and the observance of an ethical code.
A central conservative scheme for general rectangular grids
Authors: R. Kissmann, J. Pomoell, W. Kley
Venue: Journal of Computational Physics (2009)

We present an extension of the genuinely multi-dimensional semi-discrete central scheme developed in [A. Kurganov, S. Noelle, G. Petrova, Semidiscrete central-upwind schemes for hyperbolic conservation laws and Hamilton-Jacobi equations, SIAM J. Sci. Comput. 23 (3) (2001) 707-740.] to arbitrary orthogonal grids. The presented algorithm is constructed to yield the geometric scaling factors in a self-consistent way. Additionally, the order of the scheme is not fixed during the derivation of the basic algorithm. Based on the resulting general scheme it is possible to construct methods of any desired order, just by considering the corresponding reconstruction polynomial. We demonstrate how a second order scheme in plane polar coordinates and cylindrical coordinates can be derived from our general formulation. Finally, we demonstrate the correctness of this second order scheme through application to several numerical experiments.
Oscillation and non-oscillation criteria for quasi-linear second order differential equations
Authors: Wei Dong, Tieguo Ji, Xueting Zhao
Venue: WSEAS Transactions on Mathematics (2008)

Some oscillation and non-oscillation criteria for quasi-linear second order equations are obtained. These results are extensions of earlier results of C. Huang (J. Math Anal. Appl. 210 (1997), 712-723), A. Elbert (J. Math. Anal. Apll. 226 (1998), 207-219) and J. Wong (J. Math. Anal. Apll. 291 (2004), 180-188) which are all about oscillation and non-oscillation criteria of the solution of the second order linear equation. After the proof of the main theorem, two examples are given as the additional remarks of the criteria. At last a special case is discussed. And the uniqueness and periodic criteria of the special case are obtained further by using comparison theorem and Leray-Schauder degree approach.
Research on the Influence of Tunnel Wall on Radiation Field Caused by the Leaky Antenna
Authors: Jikun Guo, Xin Liu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

According to the characteristics of the electromagnetic wave propagation in tunnels, the electric field distribution of the outside leaky coaxial cables with vertical slots was analyzed. The relation of the radiation and receiving between the leaky coaxial cable and the train antenna was also analyzed in the paper. The relation between the radiation field caused by the leaky coaxial cable and the antenna location at the top of the train and the influence of the different frequencies and tunnel wall on the radiation field caused by the leaky coaxial cable were studied and simulated when the train was moving through the tunnel. The results indicate that the average field intensity is increasing with the increase of real part of complex dielectric constant and the virtual part has little influence on it.
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs
Authors: Leman Akoglu, Mary McGlohon, Christos Faloutsos
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

How do real, weighted graphs change over time? What patterns, if any, do they obey? Earlier studies focus on unweighted graphs, and, with few exceptions, they focus on static snapshots. Here, we report patterns we discover on several real, weighted, time-evolving graphs. The reported patterns can help in detecting anomalies in natural graphs, in making link prediction and in providing more criteria for evaluation of synthetic graph generators. We further propose an intuitive and easy way to construct weighted, time-evolving graphs. In fact, we prove that our generator will produce graphs which obey many patterns and laws observed to date. We also provide empirical evidence to support our claims.
Releasing the SVM Classifier with Privacy-Preservation
Authors: Keng-Pei Lin, Ming-Syan Chen
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Support vector machine (SVM) is a widely used tool in classification problem. SVM solves a quadratic optimization problem to decide which instances of training dataset are support vectors, i.e., the necessarily informative instances to form the classifier. The support vectors are intact tuples taken from the training dataset. Releasing the SVM classifier to public use or shipping the SVM classifier to clients will disclose the private content of support vectors, violating the privacy-preservation requirement in some legal or commercial reasons. To the best of our knowledge, there has not been work extending the notion of privacy-preservation to releasing the SVM classifier. In this paper, we propose an approximation approach which post-processes the SVM classifier to protect the private content of support vectors. This approach is designed for the commonly used Gaussian radial basis function kernel. By applying this post-processor on the SVM classifier, the resulted privacy-preserving SVM classifier can be publicly released without exposing the private content of support vectors and is able to provide comparable classification accuracy to the original SVM classifier.
Weighted restricted 2-matching
Authors: Gyula Pap
Venue: Mathematical Programming: Series A and B (2009)

A perfect 2-matching of a graph is a vector assigning values 0,1, or 2 to the edges such that the sum of values of edges incident with any node is equal to 2. For restricted perfect 2-matchings, we are also given a collection of &#x201c;allowed&#x201d; odd cycles, and restrict ourselves to those perfect 2-matchings the support of which contains no odd cycle not in this collection. Given a graph and a collection of allowed odd cycles, we provide a TDI description of the convex hull of restricted perfect 2-matchings. The description has large coefficients and is given implicitly, thus polynomial time separation or optimization is not straightforward. In order to have such an algorithm, one has to specify the collection of allowed odd cycles. For any fixed number k, we solve optimization in strongly polynomial time for the special cases when the collection consists of odd cycles of length less than k, or odd cycles of length more than k. These solved special cases include minimum weight perfect matching, minimum weight triangle-free and/or pentagon-free perfect perfect 2-matching, and a bunch of other relaxations of the travelling salesman problem. Our algorithm is based on a primal&#x2013;dual approach, and the unweighted algorithm of Cornu&#x00e9;jols and Hartvigsen, which is used as a subroutine. The TDI description also may be regarded as a generalization of their unweighted min&#x2013;max formula.
How well do visual verbs work in daily communication for young and old adults?
Authors: Xiaojuan Ma, Perry R. Cook
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper we study how verbs are visually conveyed in daily communication contexts for both young and old adults. Four visual modes are compared: a single static image, a panel of four static images, an animation, and a video clip. The results reveal age effects, as well as performance differences introduced by lexical verb properties and visual cues. We also suggest guidelines for visual verb creation.
Microstructured optical fiber Bragg gratings and their applications
Authors: Yan-ge Liu, Long Jin, Zhi Wang, Xiaoyi Dong
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Bragg gratings are inscribed in a highly Ge-doped index-guiding microstructured optical fiber, a grapefruit microstructure fiber, and an all-solid bandgap fiber, by conventional phase mask method. Their spectral characteristics and couplings are explained based on coupled mode theory and the analysis of their modal properties. They present some unique spectral features that could not be observed in conventional step-index fibers. These gratings would find their specific application in optical communication and fiber sensing.