ppxscal/embedding_network huggingface dataset:
Temperature wireless sensors network based on fiber Bragg grating
Authors: Bo Liu, Haibin Zhou, Junhao Tao, Yange Liu
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, we demonstrated a FBG (Fiber Bragg Grating) temperature sensor only using an EDFA and a single FBG in the wireless sensors network. By means of detecting the intensity of the light reflected from the sensing FBG, we can obtain the surrounding temperature perturbation. Using EDFA and photoelectric cell in stead of BBS (broad band source) and OSA (optical spectrum analyzer) respectively, which significantly decreases the cost of the sensing system. Finally, the sensing information can be collected, processed, and transmitted to the control center via the wireless network. This kind of FBG temperature wireless sensor network combined both the advantages of fiber grating sensor and wireless communication, which provides potential commercial application in some special fields, where the conditional sensors will not be feasible.
Supporting gardeners to plan domestic watering: a case study of designing an 'everyday simulation'
Authors: Jon Pearce, John Murphy, Wally Smith
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

We describe a project to design an internet-based application to support gardeners reasoning about the water demands and water supply for their gardens. This application is identified here as an instance of 'everyday simulation'; implying the use of simulation techniques for non-specialist users. Design strategies for everyday simulations are discussed including: the characteristic of simulations of inverting inputs and outputs; simulation by refinement; the embodiment of material constraints; and the educational aspect of simulation for non-specialists.
Use of a micro-computer in a missile simulator
Authors: James A. Rose, James V. Leonard, Herbert A. Crosby
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

In 1971 McDonnell Douglas Corporation was awarded a contract by the Department of the Navy to develop a new weapon system. The weapon system is comprised of an advanced missile, several Control and Launch Subsystems (CLS) and the support equipment required to test and maintain the missile and CLS.
CARL: experience of an application using clusters
Authors: E. Levinson, L. S. Levy, J. B. Salisbury
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

A medium size application program (~ 45,000 lines of source code) was developed using a modular design and Liskov's clusters as the main structuring data mechanism. We discuss the implications of this approach to the overall software development, including the supporting abstractions and software tools needed.
Product-Free Lambek Calculus Is NP-Complete
Authors: Yury Savateev
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

In this paper we prove that the derivability problems for product-free Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete. Also we introduce a new derivability characterization for these calculi. 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
An iterated channel estimation and tracking scheme for space-time code systems
Authors: Zhenghang Yan, Yilong Lu, Maode Ma, Yuhang Yang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, we propose an iterated channel estimation and tracking scheme for time-varying fading multi-input multi-output (MIMO) channels in a space-time code (STC) system. The proposed space-time recoding scheme is, in fact, a pseudo blind channel estimation method in the MIMO systems. It is shown that the new scheme, using the space-time recoding at the receiver for channel tracking, can provide significant error performance gains with the same channel utilization or tremendously improve channel utilization keeping same error performance of those without tracking. The new channel tracking scheme can be easily generalized to the system with M receiving antennas and N transmission antennas, or any other space-time code scenarios.
Commutativity analysis for software parallelization: letting program transformations see the big picture
Authors: Farhana Aleen, Nathan Clark
Venue: ACM SIGPLAN Notices (2009)

Extracting performance from many-core architectures requires software engineers to create multi-threaded applications, which significantly complicates the already daunting task of software development. One solution to this problem is automatic compile-time parallelization, which can ease the burden on software developers in many situations. Clearly, automatic parallelization in its present form is not suitable for many application domains and new compiler analyses are needed address its shortcomings. In this paper, we present one such analysis: a new approach for detecting commutative functions. Commutative functions are sections of code that can be executed in any order without affecting the outcome of the application, e.g., inserting elements into a set. Previous research on this topic had one significant limitation, in that the results of a commutative functions must produce identical memory layouts. This prevented previous techniques from detecting functions like malloc, which may return different pointers depending on the order in which it is called, but these differing results do not affect the overall output of the application. Our new commutativity analysis correctly identify these situations to better facilitate automatic parallelization. We demonstrate that this analysis can automatically extract significant amounts of parallelism from many applications, and where it is ineffective it can provide software developers a useful list of functions that may be commutative provided semantic program changes that are not automatable.
The evaluation of MD5 hash tools as a digital forensics class experiment
Authors: Sean J. Geoghegan, Lisa Landers, Thomas Gray
Venue: Journal of Computing Sciences in Colleges (2009)

Digital forensics tools frequently use the MD5 hash function to verify that a data set has not been altered due to the application of various evidence collection and analysis tools and procedures. Additionally, due to the impact on the personal life of the subject of an investigation, verification of the correct operation of tools and procedures is critical. This paper discusses an experiment that investigates the implementation of several MD5 hash tools. The results demonstrate that without sufficient attention to detail, unreliable tools can be created using reliable components. Additionally, unreliable results can be obtained through the improper application of the tools.
A model-driven approach for representing clinical archetypes for Semantic Web environments
Authors: Catalina Martínez-Costa, Marcos Menárguez-Tortosa, Jesualdo Tomás Fernández-Breis, José Alberto Maldonado
Venue: Journal of Biomedical Informatics (2009)

The life-long clinical information of any person supported by electronic means configures his Electronic Health Record (EHR). This information is usually distributed among several independent and heterogeneous systems that may be syntactically or semantically incompatible. There are currently different standards for representing and exchanging EHR information among different systems. In advanced EHR approaches, clinical information is represented by means of archetypes. Most of these approaches use the Archetype Definition Language (ADL) to specify archetypes. However, ADL has some drawbacks when attempting to perform semantic activities in Semantic Web environments. In this work, Semantic Web technologies are used to specify clinical archetypes for advanced EHR architectures. The advantages of using the Ontology Web Language (OWL) instead of ADL are described and discussed in this work. Moreover, a solution combining Semantic Web and Model-driven Engineering technologies is proposed to transform ADL into OWL for the CEN EN13606 EHR architecture.
An example of distributed mobile system for monitoring
Authors: Velislava Spasova
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

This paper presents an example of a distributed mobile monitoring system. It first describes the architecture of the system as consisting of sensors, mobile devices and remote server. Then, it provides description of the realized communication between the sensors and the mobile devices on one hand, and between the mobile devices and the remote server on the other. It finally discusses the possible directions in which development efforts should be concentrated.
Microsoft Visual Studio Tips
Authors: Sara Ford
Venue:  (2008)

Just as a race car team analyzes every aspect of car and driver data to optimize endurance and speed imagine your potential if you could optimize every aspect of daily coding activities with Visual Studio! The author a member of the Visual Studio team for five years has identified 251 tips to help you do just that. In her own words, There was much about Visual Studio I didn t know...until I had to learn and test it ALL. What I discovered is that although Visual Studio has a lot of options, it isn t endless and it doesn t have to be overwhelming. In fact, Visual Studio can be mastered and in this book I show you how. Performance enhancements begin in the editor, and include every other feature you touch when coding in the IDE. This book collects, illustrates, and categorizes the tips and tweaks you can apply right now to help optimize your daily routine and productivity Key Book BenefitsDelivers hundreds of proven tweaks for the Visual Studio IDE, all designed to help maximize developers time Provides practical insights into how and why features work as they do, and how to change them to suit individual needs Delves into the Visual Studio editor, searching, navigation, layout, and other capabilities 100% of the author s royalties will be donated to relief efforts in areas devastated by Hurricane Katrina
A generalization of Thue freeness for partial words
Authors: F. Blanchet-Sadri, Robert Merca, Geoffrey Scott
Venue: Theoretical Computer Science (2009)

This paper approaches the combinatorial problem of Thue freeness for partial words. Partial words are sequences over a finite alphabet that may contain a number of ''holes''. First, we give an infinite word over a three-letter alphabet which avoids squares of length greater than two even after we replace an infinite number of positions with holes. Then, we give an infinite word over an eight-letter alphabet that avoids longer squares even after an arbitrary selection of its positions are replaced with holes, and show that the alphabet size is optimal. We find similar results for overlap-free partial words.
Dynamic TCP acknowledgment with sliding window
Authors: Hisashi Koga
Venue: Theoretical Computer Science (2009)

The dynamic TCP acknowledgement problem which focuses the acknowledgment mechanism in TCP protocol has been intensively studied in the area of competitive analysis. However, its framework does not consider the sliding window in the TCP protocol that restricts the maximum number of packets that the sender can inject into the network without an acknowledgement. This paper proposes a new problem in which the sliding window is realistically integrated. We study how the ability of on-line algorithms changes, depending on whether the receiver is taught the window size. The greater part of this paper assumes that the window size is a constant integer W. We first show that, if W is given, the optimal on-line algorithm for the previous framework can be extended to our new framework and achieves the optimal competitive ratio of 2. Next we prove that, if W is not given, the lower bound of the competitive ratio for an algorithm class which contains the optimal algorithm for the previous framework depends on the peak packet rate T from the sender and W, and is not better than (T/W+[T/W]-1)-competitive. Then, we prove that there exists an on-line algorithm that is ([T/W]+2)-competitive, when W is unknown. An optimal off-line algorithm is also presented in this paper. Significantly, our problem models the situation in which an on-line algorithm involuntarily transforms the input and processes the modified input without noticing the transformation.
Fork sequential consistency is blocking
Authors: Christian Cachin, Idit Keidar, Alexander Shraer
Venue: Information Processing Letters (2009)

We consider an untrusted server storing shared data on behalf of clients. We show that no storage access protocol can on the one hand preserve sequential consistency and wait-freedom when the server is correct, and on the other hand always preserve fork sequential consistency.
Analysis of the friction processes in ultrasonic wedge/wedge-bonding
Authors: Holger Gaul, M. Schneider-Ramelow, H. Reichl
Venue: Microsystem Technologies (2009)

Research on wire bonding, the most common chip interconnection technology, has been done for over 40&#x00a0;years by now. The most common description is a model of three phases: friction, approach and interdiffusion (Lang 1988; Osterwald 1999). To quantify this model, with the main aspect at the duration of the friction phase, ultrasonic oscillation was filmed with a high speed camera. A pulsed LED light-source allowed very short exposure times of 2&#x00a0;&#x03bc;s. For the first time it was possible to make the movement of the wire visible in a reflected light exposure. After the friction phase, the end of friction (EOF) occurs. Laser vibration measurements of the tool and the pad amplitude turned out that the EOF correlates with a second, characteristic plateau of the pad amplitude. At this time, the tool amplitude has already shown its characteristic maximum and was attenuated to approximately 80% of the maximum value. After the EOF, when the wedge is bonded to the pad, a bending of the wire towards the wedge in the heel region was observed. This is a possible reason for a weakening of the heel by the US-power. While a change of the wire texture could be proved in recent investigations (Gei&#x00df;ler et&#x00a0;al. 2006), the exposure of the heel to reverse bending cycle was never verified before.
The spectral database SPECCHIO for improved long-term usability and data sharing
Authors: A. Hueni, J. Nieke, J. Schopfer, M. Kneubühler, K. I. Itten
Venue: Computers Geosciences (2009)

The organised storage of spectral data described by metadata is important for long-term use and data sharing with other scientists. Metadata describing the sampling environment, geometry and measurement process serves to evaluate the suitability of existing data sets for new applications. There is a need for spectral databases that serve as repositories for spectral field campaign and reference signatures, including appropriate metadata parameters. Such systems must be (a) highly automated in order to encourage users entering their spectral data collections and (b) provide flexible data retrieval mechanisms based on subspace projections in metadata spaces. The recently redesigned SPECCHIO system stores spectral and metadata in a relational database based on a non-redundant data model and offers efficient data import, automated metadata generation, editing and retrieval via a Java application. RSL is disseminating the database and software to the remote sensing community in order to foster the use and further development of spectral databases.
Design of novel CAM core cell structures for an efficient implementation of low power BCAM system
Authors: Palanichamy Manikandan, Bjørn B. Larsen, Einar J. Aas
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

This paper presents novel cell structures for fully parallel static type binary content addressable memory (BCAM) with low power and high flexibility. The proposed CAM core cell structures eliminate the drawbacks and adapt the advantages of single bit line and dual bit line cell structures. In this work, the word match line (ML) structure of low power BCAM employs Static pseudo CMOS (SPC) logic. HSPICE simulations for 32×32 and 128×32 BCAM systems were performed under 0.18 mm technology for different cell structures. The result shows that the proposed design provides the power dissipation of 3.94 mW with the delay time of 2.02 ns @ 1.8 V supply voltage. The measurement results of 128×32 PC-BCAM show that the proposed BCAM cell reduces power dissipation by 76% and improves search speed by 65%
Evaluation of Corporate Environmental Reports Using Data Mining Approach
Authors: Jashua Rajesh Modapothala, Biju Issac
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Growing importance in corporate environmental reporting has undermined the metrics for its examination. Any such metrics are useful in measuring the effectiveness of reports. The main aim of the study in this paper is to examine and analyze the corporate environmental reports (N=539) using data mining approach. The assessment technique implemented in this study is in line with Global Reporting Initiative (GRI) disclosures. Our findings show that the data mining approach is a reliable and robust measurement. Further findings suggest that reports addressing the criteria differ from the nature of business. The study reveals the growing importance of addressing the various stakeholder groups, industrial base approach and organizational strategies in sustainable reporting.
Approximation Schemes in Logic and Artificial Intelligence
Authors: Victor W. Marek, Mirosław Truszczyński
Venue: Transactions on Rough Sets IX (2008)

Approximate reasoning is used in a variety of reasoning tasks in logic-based artificial intelligence. In this paper we present several such reasoning schemes and show how they relate and differ from the approach of Pawlak's Rough Sets.
Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
Authors: M. F. Karavai, P. P. Parkhomenko, V. S. Podlazov
Venue: Automation and Remote Control (2009)

Consideration was given to a specific family of bipartite graphs consisting of two disjoint subsets X and Y of vertices and characterized by that each vertex in X (Y) is connected to each of the remaining vertices in X (Y) by a unique path of length two passing through some vertex in Y (X). The prefix "quasi" reflects the fact that complete connection of the vertices is realized by paths of length two rather than by edges. The problem of constructing uniform minimal graphs with identical cardinalities of the subsets X and Y which is of practical interest for complex communication networks was discussed. It belongs to the class of combinatorial problems of construction of the so-called symmetrical block designs.
Observed relationships between size measures of the internet
Authors: Brian E. Carpenter
Venue: ACM SIGCOMM Computer Communication Review (2009)

This paper reports some observations on the relationships between three measures of the size of the Internet over more than ten years. The size of the BGP4 routing table, the number of active BGP4 Autonomous Systems, and a lower bound on the total size of the Internet, appear to have fairly simple relationships despite the Internet's growth by two orders of magnitude. In particular, it is observed that the size of the BGP4 system appears to have grown approximately in proportion to the square root of the lower-bound size of the globally addressable Internet. A simple model that partially explains this square law is described. It is not suggested that this observation and model have predictive value, since they cannot predict qualitative changes in the Internet topology. However, they do offer a new way to understand and monitor the scaling of the BGP4 system.
Face Localization in 2D Frontal Face Images Using Luminosity Profiles Analysis
Authors: Marco Grassi, Marcos Faundez-Zanuy, Francesco Piazza
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)

Face detection from a single image represents a challenging task because of variability in scale, location, orientation and pose. Facial expression, occlusion, and lighting conditions also change the overall appearance of faces. In this work we propose a fast face localization method in 2D frontal face images, through eyes detection, based on the analysis of the horizontal and vertical profiles of image's average luminosity and the definition of rules describing the relations between these profiles and the positions of characteristic face elements. Experimental results over the AR face database show high rates of successful detection together with reduced computational times that make this method particularly suitable for real time applications.
Texture Segmentation Using Sequential Kernel Density Approximation
Authors: Honbo Yang, Hou Xia
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, we present a scheme for texture segmentation using sequential kernel density approximation. For sequential kernel density approximation, every texture region's intensity distribution can be described to a mixture Gaussian model, and the number of mixture model need not be set in advance. Exploiting intensity distributions directly leads to a region based measure for well-suited texture discrimination. Together with the mean of image intensity, a novel texture discrimination method is obtained. A demonstration of the performance of the scheme in this paper is given in the scope of texture segmentation.
A Coupled Dynamical Model of Redox Flow Battery Based on Chemical Reaction, Fluid Flow, and Electrical Circuit
Authors: Minghua Li, Takashi Hikihara
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The redox (Reduction-Oxidation) flow battery is one of the most promising rechargeable batteries due to its ability to average loads and output of power sources. The transient characteristics are well known as the remarkable feature of the battery. Then it can also compensate for a sudden voltage drop. The dynamics are governed by the chemical reactions, fluid flow, and electrical circuit of its structure. This causes the difficulty of the analysis at transient state. This paper discusses the transient behavior of the redox flow battery based on chemical reactions. The concentration change of vanadium ions depends on the chemical reactions and the flow of electrolysis solution. The chemical reaction rate is restricted by the attached external electric circuit. In this paper, a model of the transient behavior is introduced. The validity of the derived model is examined based on experiments for a tested micro-redox flow battery system.
Asymptotic Behavior of Global Solutions for a System of Petrovsky
Authors: Yaojun Ye, Wanzhen Zhu, Xiaoyan Zhou
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

In this paper we study the asymptotic behavior of global solutions to the initial boundary value problem for semilinear Petrovsky equation with nonlinear damping and source terms by using a difference inequality.