ppxscal/embedding_network huggingface dataset:
Binarization of Badly Illuminated Document Images through Shading Estimation and Compensation
Authors: S. J. Lu, C. L. Tan
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper presents a document image binarization tech- nique that segments text from badly illuminated document images. Based on the observations that text documents nor- mally lie over a planar or smoothly curved surface and have a uniformly colored background, badly illuminated docu- ment images are binarized by using a smoothing polynomial surface, which estimates the shading variation and com- pensates the shading degradation based on the estimated shading variation. Badly illuminated document images are accordingly binarized through the global thresholding of the compensated document images. Compared with the re- ported methods, the proposed technique is tolerant to the variations in text size and document contrast. At the same time, it is much faster and able to produce a binary text im- age with little background noise.
Making a smarter color camera
Authors: Jian Fu, H. John Caulfield
Venue: Image and Vision Computing (2008)

One meaning of ''smart camera'' is that it images objects in the class(es) of interest while not imaging objects in other class(es). Such a camera would be most useful if it were software controlled and operated at TV frame rates. In this paper, Artificial Color is applied in the design of such a camera. We show here how to segregate objects by color even when there are nearly identical neighboring colors. The process uses a multiple stage (''divide and conquer'') approach. The method used employs only linear discriminants, so it is simple to implement in software, firmware, or hardware. An example of undoing one of nature's best camouflage efforts is shown.
Myocardial fiber architecture and left ventricular function
Authors: Neil B. Ingels,  Jr.
Venue: Technology and Health Care (1997)

This paper develops several working hypotheses regarding the coupling between myocardial fiber architecture and left ventricular function. First, the coupling between spiral myocardial fibers and left ventricular torsional deformation and ejection fraction is examined. A proposal is then made to account for the observed change in orientation of myocardial fibers from a right hand helix in the subendocardium, through circumferential fibers in the midwall, to a left hand helix in the subepicardium in terms of a requirement for generating physiological values of both ejection fraction and pressure as well as equilibration of transmural fiber work. Finally, a pumping hypothesis is developed linking the contraction of each transmural layer of fibers to one another via collagen struts and weaves, with the resulting force transmitted to the epicardium and thence, by means of hydraulic forces associated with the constant volume property of the LV wall, to the endocardium to reduce the volume of the left ventricular chamber.
Considerations for Implementing a High Level Microprogramming Language Translation System
Authors: P. W. Mallett
Venue: Computer (1975)

This paper presents some considerations that affect the realization of a high-level microprogramming language translation system. A major problem discussed is concurrency recognition and microcode optimization for horizontal machines. Several design objectives are also presented that the authors believe defme the nature of a high-level language system for implementing microprograms.
Alternative Algorithm for Hilbert's Space-Filling Curve
Authors: A. R. Butz
Venue: IEEE Transactions on Computers (1971)

An algorithm for generating Hilbert's space-filling curve in a byte-oriented manner is presented. In the context of one application of space-filling curves, the algorithm may be modified so that the results are correct for continua rather than for quantized spaces.
Password management using doodles
Authors: Naveen Sundar Govindarajulu, Sriganesh Madhvanath
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

The average computer user needs to remember a large number of text username and password combinations for different applications, which places a large cognitive load on the user. Consequently users tend to write down passwords, use easy to remember (and guess) passwords, or use the same password for multiple applications, leading to security risks. This paper describes the use of personalized hand-drawn "doodles" for recall and management of password information. Since doodles can be easier to remember than text passwords, the cognitive load on the user is reduced. Our method involves recognizing doodles by matching them against stored prototypes using handwritten shape matching techniques. We have built a system which manages passwords for web applications through a web browser. In this system, the user logs into a web application by drawing a doodle using a touchpad or digitizing tablet attached to the computer. The user is automatically logged into the web application if the doodle matches the doodle drawn during enrollment. We also report accuracy results for our doodle recognition system, and conclude with a summary of next steps.
Scheduling solution for the IEEE 802.16 base station
Authors: Alexander Sayenko, Olli Alanen, Timo Hämäläinen
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

The IEEE 802.16 standard defines a wireless broadband access network technology called WiMAX. It introduces several advantages, one of which is the support for QoS at the MAC level. To ensure meeting the QoS requirements, the 802.16 base station must run some algorithm to allocate slots between connections. This algorithm is not defined in the 802.16 specification but rather is open for alternative implementations. We propose a simple, yet efficient, solution that is capable of allocating slots based on the QoS requirements, bandwidth request sizes, and the 802.16 network parameters. To test the proposed solution, we have implemented the 802.16 MAC and PHY layers in the NS-2 simulator. Several simulation scenarios are presented that demonstrate how the scheduling solution allocates resources in various cases. According to the simulation results, the proposed scheduling solution ensures the QoS requirements of all 802.16 service classes. The solution shares free resources fairly and demonstrates work-conserving behaviour.
An Improvement of AdaBoost for Face-Detection with Motion and Color Information
Authors: Randazzo Vincenzo, Usai Lisa
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

An essential component of new advanced intelligent video surveillance systems is the possibility to perform non-cooperative people detection and identification. Nowadays Face Detection and Recognition are used in access control systems where the human being is willing to help the system, but the task is much more complex in other unconstrained situations. The paper refers some results of a preliminary study to investigate the most promising approach for face detection in noncooperative conditions with the main objective to reduce as much as possible the number of false alarms working on video-rate processing speed. The proposed solution has been developed around the AdaBoost approach [1], using the open-CV library, with an integration of motion and colour segmentation. The primary scope of the paper is to refer some experimental results to show the potential improvements in terms of reduction of false positives and a significant decrease of the execution time.
The story of a working workflow management system
Authors: Steen Brahe, Kjeld Schmidt
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

This work presents experiences with the adopting of a workflow management system in a large financial institution. We describe the gradual evolution of a traditional work process, from manual to computational regulation of coordination. The study shows that computational workflows may increase labor productivity remarkably and in general have significant economic benefits, but also that to make current workflow technologies yield such results requires unorthodox twists and tweaks in the workflow design to allow for worker control and process overview. The paper argues that workflow technology is now at a stage where the contribution of CSCW is obviously needed.
Application of the Karhunen-Loève Expansion to Feature Selection and Ordering
Authors: K. Fukunaga, W. L. G. Koontz
Venue: IEEE Transactions on Computers (1970)

The Karhunen-Lo6ve expansion has been used previously to extract important features for representing samples taken from a given distribution. A method is developed herein to use the Karhunen-Loeve expansion to extract features relevant to classification of a sample taken from one of two pattern classes. Numerical examples are presented to illustrate the technique.
Disciplining Orchestration and Conversation in Service-Oriented Computing
Authors: Ivan Lanese, Francisco Martins, Vasco T. Vasconcelos, Antonio Ravara
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

We give a formal account of a calculus for modeling service-based systems, suitable to describe both service composition (orchestration) and the protocol that services run when invoked (conversation). The calculus includes primitives for defining and invoking services, for isolating conversations between clients and servers, and for orchestrating services. The calculus is equipped with a reduction and a labeled transition semantics related by an equivalence result. To hint how the structuring mechanisms of the language can be exploited for static analysis we present a simple type system guaranteeing the compatibility between client and server protocols, an application of bisimilarity to prove equivalence among services, and we discuss deadlock-avoidance.
Innovative Display Technologies–Why a Flat Panel When You can Have a CRT?
Authors: Matthew Zuckerman
Venue: IEEE Computer Graphics and Applications (1984)

Because they offer certain advantages, flat panel displays are gaining acceptance. In a few years they will be used in 10 to 12 percent of all VDTs. 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
Cross-layer perceptual ARQ for video communications over 802.11e wireless networks
Authors: P. Bucciol, E. Masala, E. Filippi, J. C. De Martin
Venue: Advances in Multimedia (2007)

This work presents an application-level perceptual ARQ algorithm for video streaming over 802.11e wireless networks. A simple and effective formula is proposed to combine the perceptual and temporal importance of each packet into a single priority value, which is then used to drive the packet-selection process at each retransmission opportunity. Compared to the standard 802.11 MAC-layer ARQ scheme, the proposed technique delivers higher perceptual quality because it can retransmit only the most perceptually important packets reducing retransmission bandwidth waste. Video streaming of H.264 test sequences has been simulated with ns in a realistic 802.11e home scenario, in which the various kinds of traffic flows have been assigned to different 802.11e access categories according to the Wi-Fi alliance WMM specification. Extensive simulations show that the proposed method consistently outperforms the standard link-layer 802.11 retransmission scheme, delivering PSNR gains up to 12 dB while achieving low transmission delay and limited impact on concurrent traffic. Moreover, comparisons with a MAC-level ARQ scheme which adapts the retry limit to the type of frame contained in packets and with an application-level deadline-based priority retransmission scheme show that the PSNR gain offered by the proposed algorithm is significant, up to 5 dB. Additional results obtained in a scenario in which the transmission relies on an intermediate node (i.e., the access point) further confirms the consistency of the perceptual ARQ performance. Finally, results obtained by varying network conditions such as congestion and channel noise levels show the consistency of the improvements achieved by the proposed algorithm.
A Design of an Experiment to Model Data Base System Performance
Authors: S. P. Ghosh
Venue: IEEE Transactions on Software Engineering (1976)

A statistical design of an experiment for modeling the performance (access time) of a data base (DB) system in a controlled environment has been outlined. A three-factor pilot experiment with retrieval sequence, logical view (combined with access method), and target segment type as factors was designed and the results analyzed for a specific IMS batch DB. It was found that: 1) the variation of sequences of DB retrieval calls in the application program did not have any signifilcant effect on the access time, whereas the other two factors did have significant effect; 2) the variability in access time is not completely explained by these three factors; and 3) the distribution of the residual error is "nonnormal," with a large positive skew.
Research on Software Component Adaptation Based on Semantic Specification
Authors: Xiong Xie, Weishi Zhang
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Software component adaptation is a crucial problem in component-based software engineering. In this paper, a component model is described firstly in mathematical specification which is helpful to specify formally component adaptation. Three component adaptation architectures are described in formal semantic, including sequential architecture, alternative architecture and parallel architecture. The conditions of adaptation architecture are analyzed and the system will select automatically a proper architecture to adapt the components according to the architecture application conditions. The specification of the complex component can be obtained automatically based on the specification of the adapted components. To compose a component based on its semantics specification, the proposed architecture supports semantic representation of components and does not depend on the computing environment. The proposed approach in the paper offers a guarantee to the formal analysis of component adaptation and the validation of the proper component adaptation.
Proceedings of the 2007 ACM workshop on Privacy in electronic society
Venue: Workshop On Privacy In The Electronic Society (2007)

These proceedings contain the papers selected for presentation at the sixth ACM Workshop on Privacy in the Electronic Society, held in association with the 14th ACM Computer and Communications Security Conference, October 29, 2007, in Alexandria, VA (USA). In response to the call for papers, 48 papers were submitted to the workshop. These papers were evaluated on the basis of their significance, novelty, and technical quality. Each paper was reviewed by at least three members of the program committee. The program committee meeting was held electronically. Nine papers were selected for long presentation at the workshop, and seven were selected for short presentation. Papers received correspondingly long or short space in the proceedings as well. The goal was to accommodate as many interesting and high-quality papers as possible given the available time.
Extended abstract: polynomial model-based evaluation of the branch coverage metric for functional verification of hardware systems
Authors: I. Ugarte, P. Sanchez
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

As the latest version of the International Technology Roadmap for Semiconductor (ITRS) highlights, verification has become the dominant cost of the electronic system design process. Although advances in formal methods have improved some aspects of the task, software simulation remains the primary method of functional verification. Traditionally, heuristic coverage metrics have been used to evaluate the simulation-based verification process. This coverage-based approach has a very serious disadvantage: the metrics have no formal meaning and so there is no direct correlation between classes of bugs and coverage metrics. The main goal of this paper is to explore methods that provide a formal meaning to branch coverage with random test benches. The methods are based on polynomial models of the system under verification and they are independent of a particular fault model.
QoS-based scheduling of workflow applications on grids
Authors: L. Mohammad Khanli, M. Analoui
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute scientific experiments on distributed resources. Such application scenarios require means for composing and executing complex workflows. Therefore, many efforts have been made towards the development of workflow management systems for Grid computing. In this paper, we propose a QoS-based workflow management system and scheduling algorithm that find the best match between workflow applications and resources while meeting QoS requests. The infrastructure is based on the event condition action (ECA) rules in active database. In none of reported works, the ECA rules haven't been used so far. We also attempt to solve the fault tolerance problem by duplicating delayed tasks using proper rules. Some rules are used for QoS monitoring. We implement the ECA rules in Grid-JQA [1, 2] in order to show that using the rules in the grid environment have better performance. The results of a simulation are provided to evaluate the main idea of the paper.
Nonlinear Modeling of Switched Reluctance Motor Based on BP Neural Network
Authors: Yan Cai, Chao Gao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Due to highly nonlinear characteristics of switched reluctance motor (SRM), an accurate nonlinear model is the key to minimize torque ripple by optimum phase current profiling. After static torque characteristics of SRM having been measured by DSP, the inverse model of torque is developed based on BP neural network. The networks are trained with several improved algorithm. It is found that for the nonlinear model of SRM, the Levenberg-Marquardt (LM) algorithm has faster convergence and more accuracy than the other techniques on BP neural network. Compared with experimental dada, accuracy of the inverse model of torque for SRM based on BP neural network with LM algorithm is proved. With this model, the torque ripple minimization can be achieved by optimum profiling of the phase current based on instantaneous torque control. Simulation results verify the feasibility of this torque ripple minimization technique.
Computer Applications
Venue: Computer (1971)

It you wish to be placed on the mailing list for the Computer-Aided Design Newsletter, circle 100 on the reader service card at the rear of this issue. 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
Cluster-based congestion control for sensor networks
Authors: Kyriakos Karenos, Vana Kalogeraki, Srikanth V. Krishnamurthy
Venue: ACM Transactions on Sensor Networks (TOSN) (2008)

In wireless sensor networks, multiple flows from data collecting sensors to an aggregating sink could traverse paths that are largely interference coupled. These interference effects manifest themselves as congestion, and cause the flows to experience high packet loss and arbitrary packet delays. This is particularly problematic in event-based sensor networks (such as those in disaster recovery missions) where some flows are of greater importance than others and require a higher fidelity in terms of packet delivery and timeliness. In this paper we present COMUT (COngestion control for MUlti-class Traffic), a distributed cluster-based mechanism for supporting multiple classes of traffic in sensor networks. COMUT is based on the self-organization of the network into clusters, each of which autonomously and proactively monitors congestion within its localized scope. The clusters then exchange appropriate information to facilitate system wide rate control where, each data source, depending on the relative importance of its data flow and the experienced congestion en route the sink, is coerced into controlling its rate. Our simulation results demonstrate that (i) our techniques are highly effective in dealing with multiple, interfering flows and in achieving high delivery ratios and low delays compared to traditional approaches, (ii) operate successfully over multiple underlying routing protocols, (iii) provide higher throughput to higher importance flows, (iv) are responsive to failures and, finally, (v) achieve substantial energy savings due to the considerable reduction in packet drops via the effective regulation of the network load.
Concluding Remarks
Authors: B. W. Boehm
Venue: Computer (1975)

At this point, there is no good reason for an organization not to take steps toward adopting some variant of SP techniques. The particular variant will depend a lot on your organization: factors such as the type of applications, personnel, languages used, inventory of existing code, organizational constraints, and typical project size can lead to different preferred approaches. A careful planning and training phase should precede use of the techniques, in order to minimize the risks of their misuse. With this preparation, the benefits of using a suitably tailored SP variant will significantly outweigh the risks.
EEGR: Energy-Efficient Geographic Routing inWireless Sensor Networks
Authors: Haibo Zhang, Hong Shen
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

This paper introduces a novel geographic routing protocol called Energy-Efficient Geographic Routing (EEGR) for wireless sensor networks. In EEGR, both geographic information and transceiver power characteristics are employed to make forwarding decisions, thereby enabling an energy-aware localized routing strategy. We prove that EEGR is loop-free and derive the bounds on hop count for sensor-to- sink packet delivery. In particular, we analyze the energy dissipation under EEGR and present the approximated expected energy consumption for sensor-to-sink data delivery when nodes are uniformly deployed. Simulation results demonstrate that EEGR can provide near-optimal energy-efficient routing only based on local information.
Diagnosis service for embedded software component based systems
Authors: Thi Quynh Bui, Oum-El-Kheir Aktouf
Venue: Proceedings of the 2007 workshop on Engineering fault tolerant systems (2007)

This paper studies the fault diagnosis of component-based applications, especially embedded ones. The principle of the proposed diagnosis technique is to implement inter-component tests in order to detect and locate faulty components without component replication. A diagnosis service for embedded software component based systems is developed. Its advantages are application autonomy, cost-effectiveness and better usage of system resources. Such advantages are very important for embedded systems.
Authors' Reply2
Authors: D. C. Schmidt
Venue: IEEE Transactions on Computers (1980)

Mr. Oberman appears to be taking issue with our paper1in three areas.