ppxscal/embedding_network huggingface dataset:
The circuit design of current-mode image sensor embedded smooth spatial filter with flash A/D converter
Authors: Chia-Chun Tsai, Huang-Chi Chou, Trong-Yen Lee
Venue: WSEAS Transactions on Circuits and Systems (2009)

The paper presents a current-mode CMOS image sensor embedded smooth spatial filter algorithm with a flash analog-to-digital (A/D) converter. The sensor includes a 66×66 pixel array with an on-chip 6-bit A/D converter that can identify the output value of pixels in gray level resolution. The last row of pixel cells (1 ×66) based on the double sampling is used for reducing fixed pattern noise (FPN). Processing circuits are dedicated for the spatial filter algorithm and support reusability to increase the image processing speed and to reduce the design complexity and chip area. The sensor chip has been designed and implemented in TSMC 0.35µm 2P4M CMOS mixed-mode process. Experimental results show that each pixel occupies a area of 15.8µm×10.6µm with a fill factor of 37.2%. The power consumption is 35.15mW when the sensor operates at 175 frames/second.
Decentralised control of adaptive sampling and routing in wireless visual sensor networks
Authors: Johnsen Kho, Long Tran-Thanh, Alex Rogers, Nicholas R. Jennings
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

The efficient management of the limited energy resources of a wireless visual sensor network is central to its successful operation. Within this context, this paper focuses on the inter-dependent adaptive sampling and routing actions of each node in order to maximise the information value of the data collected. Thus, we develop two optimal decentralised algorithms to solve this distributed constraint optimization problem. The first assumes fixed routing and works in tree-structured networks. The second works in networks with any topologies by using a flexible routing approach. The two algorithms represent a trade-off in optimality, communication cost, and processing time. In an empirical evaluation on loopy sensor networks, we show that the flexible routing algorithm is able to deliver approximately twice the quantity of information compared to the fixed routing algorithm, where an arbitrary choice of route is made. However, this gain comes at a considerable communication and computational cost (increasing both by a factor of 100 times).
Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm
Authors: Anton Leykin, Jan Verschelde
Venue: International Journal of Computational Science and Engineering (2009)

Our problem is to decompose a positive dimensional solution set of a polynomial system into irreducible components. This solution set is represented by a witness set, which can be partitioned into irreducible subsets according to the action of monodromy. Our straightforward parallel version of the original monodromy breakup algorithm suffers from synchronisation issues. The new approach not only resolves these issues, but also, according to accumulated statistics, reduces the expected number of homotopy continuation paths tracked. The latter property gives a faster serial algorithm.
Analysis of Multiconductor Transmission Lines, 2nd edition
Authors: Clayton R. Paul
Venue:  (2007)

The essential textbook for electrical engineering students and professionals-now in a valuable new edition The increasing use of high-speed digital technology requires that all electrical engineers have a working knowledge of transmission lines. However, because of the introduction of computer engineering courses into already-crowded four-year undergraduate programs, the transmission line courses in many electrical engineering programs have been relegated to a senior technical elective, if offered at all. Now, Analysis of Multiconductor Transmission Lines, Second Edition has been significantly updated and reorganized to fill the need for a structured course on transmission lines in a senior undergraduate- or graduate-level electrical engineering program. In this new edition, each broad analysis topic, e.g., per-unit-length parameters, frequency-domain analysis, time-domain analysis, and incident field excitation, now has a chapter concerning two-conductor lines followed immediately by a chapter on MTLs for that topic. This enables instructors to emphasize two-conductor lines or MTLs or both. In addition to the reorganization of the material, this Second Edition now contains important advancements in analysis methods that have developed since the previous edition, such as methods for achieving signal integrity (SI) in high-speed digital interconnects, the finite-difference, time-domain (FDTD) solution methods, and the time-domain to frequency-domain transformation (TDFD) method. Furthermore, the content of Chapters 8 and 9 on digital signal propagation and signal integrity application has been considerably expanded upon to reflect all of the vital information current and future designers of high-speed digital systems need to know. Complete with an accompanying FTP site, appendices with descriptions of numerous FORTRAN computer codes that implement all the techniques in the text, and a brief but thorough tutorial on the SPICE/PSPICE circuit analysis program, Analysis of Multiconductor Transmission Lines, Second Edition is an indispensable textbook for students and a valuable resource for industry professionals.
A Benchmarking-Based Requirement Analysis Methodology for Improving Web Sites
Authors: Min-Seok Pang, Woojong Suh, Jongho Kim, Heeseok Lee
Venue: International Journal of Electronic Commerce (2009)

Benchmarking is a critical activity in Web site development and has been employed for requirement analysis in a variety of Web site renewal and development projects. By comparing their current Web site with competitors' cutting-edge sites, managers can attain improvement in quality. Despite the importance and popularity of benchmarking, however, the literature sheds little light on the incorporation of its techniques into Web site improvement methodologies. This paper proposes a benchmarking-based requirement analysis methodology coupled with a goal-driven approach. The methodology works through three phases-elicitation, analysis, and specification-to seamlessly link business requirements to implementation details. Use cases are employed to capture functional requirements. Web sites are investigated in terms of usability to sharpen nonfunctional requirements. The usefulness of the methodology is demonstrated by applying it to improve a real-life Web site.
Online supportive interactions: Using a network approach to examine communication patterns within a psychosis social support group in Taiwan
Authors: Hui-Jung Chang
Venue: Journal of the American Society for Information Science and Technology (2009)

A network approach was used to determine the overall supportive communication patterns constructed within the PTT psychosis support group in Taiwan, the largest bulletin board system in the Chinese-speaking world. The full sequences of supportive interactions were observed over a $2{\textstyle{1 \over 2}}$-year period from February 2004 to July 2006. The results indicated that the most exchanged support types were information and network links. All types of supportive communication networks were relatively sparse, yet small groups of cliques with different provision of support types formed within the psychosis group. Most of the online supportive interactions exchanged at dyadic and triadic levels. The overall supportive network was highly centralized. The overall findings with implications for future studies were discussed. &copy; 2009 Wiley Periodicals, Inc.
InvisiFence: performance-transparent memory ordering in conventional multiprocessors
Authors: Colin Blundell, Milo M.K. Martin, Thomas F. Wenisch
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

A multiprocessor's memory consistency model imposes ordering constraints among loads, stores, atomic operations, and memory fences. Even for consistency models that relax ordering among loads and stores, ordering constraints still induce significant performance penalties due to atomic operations and memory ordering fences. Several prior proposals reduce the performance penalty of strongly ordered models using post-retirement speculation, but these designs either (1) maintain speculative state at a per-store granularity, causing storage requirements to grow proportionally to speculation depth, or (2) employ distributed global commit arbitration using unconventional chunk-based invalidation mechanisms. In this paper we propose InvisiFence, an approach for implementing memory ordering based on post-retirement speculation that avoids these concerns. InvisiFence leverages minimalistic mechanisms for post-retirement speculation proposed in other contexts to (1) track speculative state efficiently at block-granularity with dedicated storage requirements independent of speculation depth, (2) provide fast commit by avoiding explicit commit arbitration, and (3) operate under a conventional invalidation-based cache coherence protocol. InvisiFence supports both modes of operation found in prior work: speculating only when necessary to minimize the risk of rollback-inducing violations or speculating continuously to decouple consistency enforcement from the processor core. Overall, InvisiFence requires approximately one kilobyte of additional state to transform a conventional multiprocessor into one that provides performance-transparent memory ordering, fences, and atomic operations.
Using critical questions to disambiguate and formalize statutory provisions
Authors: Matthias Grabmair, Kevin D. Ashley
Venue: Proceedings of the 12th International Conference on Artificial Intelligence and Law (2009)

This paper outlines a process model for disambiguating legal provisions in order to ease their formalization into logic. It centers around a reformulation of the provision driven by critical questioning and mandatory legal justifications.
Design and Analysis of Integrated Low-Power Ultrawideband Receivers, 1st edition
Authors: Ivan Siu-Chuang Lu, Sri Parameswaran
Venue: Analog Circuits And Signal Processing (2007)

Ultra-wideband (UWB) radio technology has been touted as the future of personal wireless communication applications. By communicating via short nanosecond pulses, UWB systems promise low power, high data rate communication while providing fine resolution in the time domain. In contrast to UWB, existing narrowband WLAN systems operates by modulating data onto a continuous carrier with strong transmitted power. Due to pulses low power spectrum density (PSD) and high resolution in the time domain, UWB systems are particularly suited to short to medium range wireless communications as they offer high speed data transfer with precise location awareness, immunity to multipath fading, and multiuser capabilities. A successful radio system design requires detailed understanding of the characteristics of the radio signal employed in the communication system. This book provides a comprehensive overview of ultra-wideband communication, starting with the fundamental concepts underlying the UWB technology, as well as its benefits and potential applications in wireless communications. Further, the current Federal Communications Commission (FCC) regulations for UWB deployment in the United States, as well as the Direct Spectrum UWB (DS-UWB) and Multiband Orthogonal Frequency Division Multiplexing (MBOFDM) approaches under consideration for IEEE standardization are discussed. The book also presents an overview of the challenges in the implementation of UWB systems with emphasis placed on low-power receiver designs.
Uniqueness and existence results for initial value problems on time scales through a reciprocal problem and applications
Authors: Victoria Otero-Espinar, Dolores R. Vivero
Venue: Computers Mathematics with Applications (2009)

This paper is devoted to deriving the existence, uniqueness and approximation of solutions to a first-order initial value problem on an interval of an arbitrary time scale, taking values in a different time scale. We obtain the results considering dynamic equations whose nonlinear part is nonnegative and satisfies a type of ''inverse'' Caratheodory's conditions and discontinuity. Several examples are given to illustrate the applicability of these results.
Assessing Confidence in Cased Based Reuse Step
Authors: F. Alejandro García, Javier Orozco, Jordi Gonzàlez
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

Case-Based Reasoning (CBR) is a learning approach that solves current situations by reusing previous solutions that are stored in a case base. In the CBR cycle the reuse step plays an important role into the problem solving process, since the solution for a new problem is based in the available solutions of the retrieved cases. In classification tasks a trivial reuse method is commonly used, which takes into account the most frequently solution proposed by the set of retrieved cases. We propose an alternative reuse process; we call confidence-reuse method, which make a qualitative assessment of the information retrieved. This approach is focused on measuring the solution accuracy, applying some confidence predictors based in a k-NN classifier with the aim of analyzing and evaluating the information offered by the retrieved cases.
Rough neural fault classification for hvdc power systems
Authors: Liting Han
Venue:  (2008)

This Ph.D. thesis proposes an approach to classify faults that commonly occur in a High Voltage Direct Current (HVDC) power system. These faults are distributed throughout the entire HVDC system. The most recently published techniques for power system fault classification are the wavelet analysis, two-dimensional time-frequency representation for feature extraction and conventional artificial neural networks for fault type identification. The main limitation of these systems is that they are commonly designed to focus on a group of faults involved in a specific area of a power system. This thesis introduces a framework for fault classification that covers a wider range of faults. The proposed fault classification framework has been initiated and developed in the context of the HVDC power system at Manitoba Hydro, which uses what is known as the Transcan&trade; system to record and archive fault events in files. Each fault file includes the most active signals (there are 23 of them) in the power system. Testing the proposed framework for fault classification is based on fault files collected and classified manually over a period of two years. The fault classification framework presented in this thesis introduces the use of the rough membership function in the design of a neural fault classification system. A rough membership function makes it possible to distinguish similar feature values and measures the degree of overlap between a set of experimental values and a set of values representing a standard (e.g., set of values typically associated with a known fault). In addition to fault classification using rough neural networks, the proposed framework includes what is known as a linear mean and standard deviation classifier. The proposed framework also includes a classifier fusion technique as a means of increasing the fault classification accuracy. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A collaborative sensor network middleware for automated production systems
Authors: Wootae Jeong, Shimon Y. Nof
Venue: Computers and Industrial Engineering (2009)

Recent advanced production facilities have utilized networked sensors, which are increasingly designed as e-Work networks with sensor collaboration. Especially, wireless networked microsensors network have been developed and are about to gain widespread use as technology and reliability improve and prices drop. Especially, the redundantly distributed microsensor-based system can significantly and cost-effectively improve the quality of service, processes, and productivity in automated production systems. Besides energy consumption and scalability, a major design challenge, however, is that they must be designed to be adaptable for industrial applications. Most industrial applications require better reliability in communication, robustness to various interferences, fault tolerance, and the geometry of the production facility that collaborating sensors are implemented. Thus, this research proposes a sensor network middleware structure that automated production systems require. The middleware supports optimal or near-optimal multi-sensor deployment scheme and provides solutions for geometry-specific wireless microsensor deployment design. The middleware model is also supported by collaborative e-work network framework. Network design parameters such as the number of sensors, geometry of production facility are being considered to improve reliability of sensory data and to minimize the overall energy consumption under given geometry. Results are also evaluated through specific simulations, applying the Teamwork Integration Evaluator (TIE).
Accessibility Evaluation for GUI Software Using Source Programs
Authors: Junko Shirogane, Takashi Mori, Hajime Iwata, Yoshiaki Fukazawa
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

Computers and software are now widely used in human society. With their dissemination, it becomes necessary for disabled and elderly people to use software. However, it is difficult to develop accessible software for them. Also, there are many guidelines and support tools for developing accessible web sites. However, for software, such guidelines and support tools are few. In our research, to develop accessible software easily, we propose a method of evaluating the accessibility of Graphical User Interface (GUI) software. In our method, source programs of GUI software are analyzed, the accessibility of the GUI software is evaluated along with the accessibility guidelines, and the list of unsatisfactory codes for accessibility and indications on how to modify them are shown.
Analyses of velocity, acceleration, statics, and workspace of a 2(3-spr) serial-parallel manipulator
Authors: Yi Lu, Bo Hu, Tao Sun
Venue: Robotica (2009)

The kinematics, statics, and workspace of a 2(3-SPR) serial-parallel manipulator (S-PM) are studied systematically in this paper. First, a 2(3-SPR) S-PM including an upper 3-SPR parallel manipulator (PM) and a lower 3-SPR PM is constructed, and the inverse/forward displacements, velocity, acceleration, and statics of the lower and upper 3-SPR PMs are studied, respectively. Second, the kinematics and statics of the lower and upper 3-SPR PMs are combined and the displacement, velocity, acceleration, and statics of a 2(3-SPR) S-PM are analyzed systematically. Third, a workspace of the 2(3-SPR) S-PM is constructed and analyzed. Finally, the analytic solved results are given and verified by the simulation mechanism.
Partitioning of Servers in Queueing Systems During Rush Hour
Authors: Bin Hu, Saif Benjaafar
Venue: Manufacturing Service Operations Management (2009)

This paper is motivated by two phenomena observed in many queueing systems in practice. The first is the partitioning of server capacity among different customers based on their service time requirements. The second is rush hour demand where a large number of customers arrive over a short period of time followed by few or no arrivals for an extended period thereafter. We study a system with multiple parallel servers and multiple customer classes. The servers can be partitioned into server groups, each dedicated to a single customer class. The system operates under a rush hour regime with a large number of customers arriving at the beginning of the rush hour period. We show that this allows us to reduce the problem to one that is deterministic and for which closed-form solutions can be obtained. We compare the performance of the system with and without server partitioning during rush hour and address three basic questions. (1) Is partitioning beneficial to the system? (2) Is it equally beneficial to all customer classes? (3) If it is implemented, what is an optimal partition? We evaluate the applicability of our results to systems where customers arrive over time using (1) deterministic fluid models and (2) simulation models for systems with stochastic interarrival times.
Knowledge extraction and representation of collaborative activity through ontology-based and Social Network Analysis technologies
Authors: Luis Casillas, Thanasis Daradoumis
Venue: International Journal of Business Intelligence and Data Mining (2009)

This paper describes an approach for extracting and representing the knowledge generated from collaborative interaction of small learning teams that work together in distance to carry out a software project or a case study. Our approach is based on ontology, Social Network Analysis (SNA) and fuzzy classification, which has been initially developed as a mechanism to analyse and understand behavioural patterns from collaboration performed in different scenarios. Through the SNA we are able to define an ontological profile that provides a deep knowledge about the participants' roles, intentions and effects; hence a fuzzy model can perform inferences over individual indicators.
Existence, uniqueness and finite difference solution for the Dirichlet problem of the Schrodinger-Maxwell equations
Authors: Nikos E. Mastorakis
Venue: WSEAS Transactions on Mathematics (2009)

In this paper, the existence, the Uniqueness and the Finite Difference Scheme for the Dirichlet problem of the Schrodinger-Maxwell equations is going to be presented.
An Unconstrained Multiphase Thresholding Approach for Image Segmentation
Authors: Benjamin Berkels
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

In this paper we provide a method to find global minimizers of certain non-convex 2-phase image segmentation problems. This is achieved by formulating a convex minimization problem whose minimizers are also minimizers of the initial non-convex segmentation problem, similar to the approach proposed by Nikolova, Esedo¿lu and Chan. The key difference to the latter model is that the new model does not involve any constraint in the convex formulation that needs to be respected when minimizing the convex functional, neither explicitly nor by an artificial penalty term. This approach is related to recent results by Chambolle. Eliminating the constraint considerably simplifies the computational difficulties, and even a straightforward gradient descent scheme leads to a reliable computation of the global minimizer. Furthermore, the model is extended to multiphase segmentation along the lines of Vese and Chan. Numerical results of the model applied to the classical piecewise constant Mumford-Shah functional for two, four and eight phase segmentation are shown.