ppxscal/embedding_network huggingface dataset:
Physics of Automatic Target Recognition
Authors: Firooz Sadjadi, Bahram Javidi
Venue: Advanced Sciences And Technologies For Security Applications (2007)

The Physics of Automatic Target Recognition is part of a series focusing on Advanced Sciences and Technologies for Security Applications. This book will address the fundamental physical bases of sensing, and information extraction in the state-of-the art automatic target recognition field. We will explore both passive and active multispectral sensing, polarimetric diversity, complex signature exploitation, sensor and processing adaptation, transformation of electromagnetic and acoustic waves in their interactions with targets, background clutter, transmission media, and sensing elements. The general inverse scattering, and advanced signal processing techniques and scientific evaluation methodologies being used in this multi disciplinary field will be part of this exposition. The issues of modeling of target signatures in various spectral modalities, LADAR, IR, SAR, high resolution radar, acoustic, seismic, visible, hyperspectral, in diverse geometric aspects will be addressed. The problem of clutter modeling from a physics point of view will be also explored. The methods for signal processing and classification will cover concepts such as sensor adaptive and artificial neural networks, time reversal filter. The issue of invariants of sensor and transmission transformations (geometrical, spectral and polarimetric invariants) will be explored . These invariants are crucial in the development of low latency and computationally manageable ATR systems. The book will address the issue of transformations that a signal goes through in its interactions with targets and background, in its passage through a medium and its final reception by a sensor. It is only through understanding these transformations that one can hope in addressing the inverse problem: the identification of originating sources of a signal (target recognition). Advanced Sciences and Technologies for Security Applications focuses on research monographs in th
A wide area measurement based neurocontrol for generation excitation systems
Authors: Swakshar Ray, Ganesh K. Venayagamoorthy
Venue: Engineering Applications of Artificial Intelligence (2009)

Power system is a highly interconnected nonlinear system that needs optimal and accurate control for continuous operation. Large power transfer through long transmission line between different electrical areas, stressed system and adverse interaction between local controllers, may give rise to slow frequency inter-area oscillations. The inter-area modes may not be visible from local measurements and hence it is useful to use remote measurement based centralized supplementary control. Wide area control systems (WACSs) using wide-area or global signals can provide remote auxiliary control to local controllers such as automatic voltage regulators, power system stabilizers, etc. to damp out inter-area oscillations. This paper presents a design and real time implementation of a nonlinear neural network based optimal wide area controller using adaptive critic design (ACD). The real time implementation of a power system model is carried out on a real time digital simulator (RTDS). The performance of the WACS as a power system stability agent is studied using a two-area power system under different operating conditions and contingencies. The WACS shows improvement in the damping of inter-area mode with the use of supplementary excitation control. In addition, results show that the designed controller can provide robust performance under small communication delay in remote signal transmission.
Programming robots with state diagrams
Authors: Bogdan Denny Czejdo, Sambit Bhattacharya
Venue: Journal of Computing Sciences in Colleges (2009)

This paper discusses the advantages of using state diagrams to model the behavior of robots and how to translate those models into code. Our main focus was to use robot programming with state diagrams as a context to teach introductory programming languages in an undergraduate curriculum.
YA: Fast and Scalable Discovery of Idle CPUs in a P2P network.
Authors: Javier Celaya, Unai Arronategui
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present a fast, scalable and efficient discovery protocol founded on a tree-based peer-to-peer (p2p) network with fault-tolerant capabilities and locality features. Each system node stores a good estimation of the number of CPUs that are available in its branch. Each node notifies its father about changes in this value only when it is meaningful enough. This allows low overhead and a stable behavior with concurrent and dynamic allocation of CPUs. This basic mechanism allows any node to launch a discovery process, that needs only to follow the information of free CPUs in each branch. Results from experiments and simulation tests, using a simple allocation method, show discovery time scaling logarithmically with the number of nodes.
On Optimal Batching Policies for Video-on-Demand Storage Servers
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

In a video-on-demand environment, batching of video requests is often used to reduce I/O demand and improve throughput. Since viewers may defect if they experience long waits, a good video scheduling policy needs to consider not only the batch size but also the viewer defection probabilities and wait times. Two conventional scheduling policies for batching are first-come-first-served (FCFS) and maximum queue length (MQL). Neither of these policies lead to entirely satisfactory results. MQL tends to be too aggressive in scheduling popular videos by only considering the queue length to maximize batch size, while FCFS has the opposite effect. In this paper, we introduce the notion of factored queue length and propose a batching policy that schedules the video with the maximum factored queue length}. We refer to this as the MFQ policy. The factored queue length is obtained by weighting each video queue length with a factor which is biased against the more popular videos. An optimization problem is formulated to solve for the best weighting factors for the various videos. A simulation is developed to compare the proposed MFQ policy with FCFS and MQL. Our study shows that MFQ yields excellent empirical results in terms of standard performance measures such as average latency time, defection rates and fairness.
Electrical characteristics and modelling of multi-island single-electron transistor using SIMON simulator
Authors: A. Boubaker, M. Troudi, Na. Sghaier, A. Souifi, N. Baboux, A. Kalboussi
Venue: Microelectronics Journal (2009)

In this paper, we present a multi-island single-electron transistor (MISET) model based on the orthodox theory and solving the master equation. Using SIMON simulator, we investigate the electrical characteristics of single-electron transistors (SETs) based on multiple islands and show the temperature dependence of the Coulomb oscillation of the SET with one to six islands as a function of gate voltage Vg in the temperature range from T=5 to 50K. Values of current tend to increase proportionally with temperature. For a high drain voltage, the MISET behaved as a single-island device. This is probably because the multiple islands were electrically enlarged and merged into a single island owing to the high applied drain voltage. Finally, we compare the advantages of MISET face to single-island SETs with identical dimensions of islands.
Agent-based replication for scaling back-end databases of dynamic content web sites
Authors: Ebada Sarhan, Atif Ghalwash, Mohamed Khafagy
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Replication has become a central element in modern information system playing a great role to increase availability and performance. This paper presents architecture, implementation and performance of a new replication technique. This new replication concerns of back-end database of a dynamic sites. The presented technique, called Agent scheduling, using agents, in both the application server and the back-end database, to replace the scheduler. The telecommunication benchmark, a powerful benchmark that is able to test up to fifty database replicas, That can be used for evaluation. Evaluation could be performed through measurements of a web site that follows the TPC-W specification. Test results show that Agent-scheduling throughput and response time outperform other algorithms especially with large clusters.
Governance and game theory: When do franchise auctions induce firms to overbid?
Authors: Richard D. French
Venue: Telecommunications Policy (2009)

The use of auctions as an instrument of public policy has been hailed as evidence of the utility and validity of game theory. In this paper, we focus on extreme cases - centrally, spectrum auctions in the UK and Germany in 2000 - to argue that the canonical game theoretic interpretations of firm behaviour in some (highly ''successful'') auction outcomes are inadequate, that the economics of governance critique of franchise bidding can be extended to provide a better interpretation, and that under specified conditions, notably high uncertainty, policy-makers should design franchise auctions to avoid overbidding, rather than attend to the more conventional challenge of underbidding.
Synergy: sharing-aware component composition for distributed stream processing systems
Authors: Thomas Repantis, Xiaohui Gu, Vana Kalogeraki
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

Many emerging on-line data analysis applications require applying continuous query operations such as correlation, aggregation, and filtering to data streams in real-time. Distributed stream processing systems allow in-network stream processing to achieve better scalability and quality-of-service (QoS) provision. In this paper we present Synergy, a distributed stream processing middleware that provides sharing-aware component composition. Synergy enables efficient reuse of both data streams and processing components, while composing distributed stream processing applications with QoS demands. Synergy provides a set of fully distributed algorithms to discover and evaluate the reusability of available data streams and processing components when instantiating new stream applications. For QoS provision, Synergy performs QoS impact projection to examine whether the shared processing can cause QoS violations on currently running applications. We have implemented a prototype of the Synergy middleware and evaluated its performance on both PlanetLab and simulation testbeds. The experimental results show that Synergy can achieve much better resource utilization and QoS provision than previously proposed schemes, by judiciously sharing streams and processing components during application composition.
Realization of simulations for blinded internal pilot study based on web
Authors: Suzhen Wang, Jielai Xia, Lili Yu, Chanjuan Li, Li Xu, Liang Zheng
Venue: Journal of Biomedical Informatics (2009)

Misspecification of the designing parameters in the planning of a controlled clinical trial may yield an underpowered or an overpowered study. Internal pilot study, a kind of adaptive design, has gained increased attention for its allowing for sample size adjustment, especially blinded sample size adjustment that do not affect the type I error rate. Several methods were proposed to implement internal pilot design in recent years and some software emerges to simulate or implement it. But most of the software is only running on a stand-alone terminal or Client/Server(C/S) mode. We develop a system to simulate it based on Browser/Server(B/S) mode and realized on web. It allows the web users to input corresponding parameters from the web browser such as Internet Explorer to make simulations. The system was constructed with generic database schema design method and coded with Microsoft Visual Basic and Active Server Pages (ASP) programming languages. Web users on internet can use the system to make blinded variance estimate, sample size adjustment and randomization test for internal pilot study. The application of the simulation is demonstrated through an example. Not only blinded sample size adjustment is implemented but also a randomization test is performed. With applications of blinding one-sample variance for sample size recalculation and randomization test, the type I error rate is also controlled successfully.
New method to assess barley nitrogen nutrition status based on image colour analysis
Authors: Miguel Pagola, Rubén Ortiz, Ignacio Irigoyen, Humberto Bustince, Edurne Barrenechea, Pedro Aparicio-Tejo, Carmen Lamsfus, Berta Lasa
Venue: Computers and Electronics in Agriculture (2009)

Measuring the nitrogen nutrition status of plants is useful for nitrogen fertiliser management. As nitrogen is one of the main structural components of chlorophyll, its nutrition status is highly correlated with the greenness of leaves. This paper proposes and evaluates a new low-cost method to estimate the N-nutrition status of plants using digital colour image analysis. A method has been developed in which principal component analysis is applied to digital images to calculate a greenness index using RGB components of the colour image, which yields an estimate of the amount of N in the plant. To evaluate its quality, we calculated the correlation between the index and measurements obtained with a SPAD-502 chlorophyll meter, normally used in decision-making in fertiliser management. The performance of the proposed index is better than that of others previously investigated. Furthermore, the capacity of our index to predict N deficiencies affecting barley yield was equal to or better than that of SPAD measurements under our experimental conditions.
Is privacy an attainable goal?: a review of the privacy rights dilemma
Authors: Anasuya Bulkan
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

This paper aims to present an overview of the entitlements that a user should be allowed when it comes to privacy rights as well as the strides that have been made to develop privacy policies. It also aims to investigate whether an acceptable level to both the user and the other contractual party is indeed possible.
A survey of software learnability: metrics, methodologies and guidelines
Authors: Tovi Grossman, George Fitzmaurice, Ramtin Attar
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

It is well-accepted that learnability is an important aspect of usability, yet there is little agreement as to how learnability should be defined, measured, and evaluated. In this paper, we present a survey of the previous definitions, metrics, and evaluation methodologies which have been used for software learnability. Our survey of evaluation methodologies leads us to a new question-suggestion protocol, which, in a user study, was shown to expose a significantly higher number of learnability issues in comparison to a more traditional think-aloud protocol. Based on the issues identified in our study, we present a classification system of learnability issues, and demonstrate how these categories can lead to guidelines for addressing the associated challenges.
DOA Estimation Based on Sparse and Nonuniform COLD Array
Authors: Liu Liang, Tao Jianwu, Cui Wei
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

This paper presents a method of direction of arrival (DOA) estimation with no ambiguity based on sparse and nonuniform concentered orthogonal loop and dipole (COLD) array, which enhances the resolution of DOA estimation in the case of less array elements. And the ambiguity of the sparse and nonuniform COLD array is analyzed and the results of the analysis indicate that the sparse and nonuniform COLD array considered can not cause spurious peaks of the DOAs under certain conditions. Some numerical simulations illustrate the validity of the proposed method.
A Posteriori Soundness for Non-deterministic Abstract Interpretations
Authors: Matthew Might, Panagiotis Manolios
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

An abstract interpretation's resource-allocation policy (e.g., one heap summary node per allocation site) largely determines both its speed and precision. Historically, context has driven allocation policies, and as a result, these policies are said to determine the "context-sensitivity" of the analysis. This work gives analysis designers newfound freedom to manipulate speed and precision by severing the link between allocation policy and context-sensitivity: abstract allocation policies may be unhinged not only from context, but also from even a predefined correspondence with a concrete allocation policy. We do so by proving that abstract allocation policies can be made non-deterministic without sacrificing correctness; this non-determinism permits precision-guided allocation policies previously assumed to be unsafe. To prove correctness, we introduce the notion of a posteriori soundness for an analysis. A proof of a posteriori soundness differs from a standard proof of soundness in that the abstraction maps used in an a posteriori proof cannot be constructed until after an analysis has been run. Delaying construction allows them to be built so as to justify the decisions made by non-determinism. The crux of the a posteriori soundness theorem is to demonstrate that a justifying abstraction map can always be constructed.
Adaptive Load Sharing and Scheduling Schemes for Distributed Continuous Media Delivery
Authors: Yen-Jen Lee, David H. C. Du
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The purpose of load sharing is to improve both the performance and readiness of non-interrupted continuous media delivery by redistributing workload among collaborating servers. We proposed and evaluate a few adaptive load sharing policies where simple scheduling schemes are derived. The objectives are: 1) to understand the potential load imbalance problem in distributed multimedia system, 2) to minimize the initial latency where system workload is constantly changed, and 3) to maintain the stability of the overall system. We develop a Two-phase List Scheduling with partial reordering of incoming requests to meet the challenge. The end result suggests that, migrating workload to highly loaded continuous media server generates best implementation alternative.
Non-convex Representations of Graphs
Authors: Giuseppe Battista, Fabrizio Frati, Maurizio Patrignani
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We show that every plane graph admits a planar straight-line drawing in which all faces with more than three vertices are non-convex polygons.
PHONE BRAVER 7
Authors: Masashi Kobayashi
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

The protagonist is a high school student, Keita Amishima, who has recently moved to Tokyo. Being a bit on the shy side, he's had real trouble fitting in since the move. One day, he finally decides he's going to run away from home to get away from it all.
Liver segmentation from computed tomography scans: A survey and a new algorithm
Authors: Paola Campadelli, Elena Casiraghi, Andrea Esposito
Venue: Artificial Intelligence in Medicine (2009)

Objective: In the recent years liver segmentation from computed tomography scans has gained a lot of importance in the field of medical image processing since it is the first and fundamental step of any automated technique for the automatic liver disease diagnosis, liver volume measurement, and 3D liver volume rendering. Methods: In this paper we report a review study about the semi-automatic and automatic liver segmentation techniques, and we describe our fully automatized method. Results: The survey reveals that automatic liver segmentation is still an open problem since various weaknesses and drawbacks of the proposed works must still be addressed. Our gray-level based liver segmentation method has been developed to tackle all these problems; when tested on 40 patients it achieves satisfactory results, comparable to the mean intra- and inter-observer variation. Conclusions: We believe that our technique outperforms those presented in the literature; nevertheless, a common test set with its gold standard traced by experts, and a generally accepted performance measure are required to demonstrate it.
Global random walk modelling of transport in complex systems
Authors: N. Suciu, C. Vamo&#x015f;, I. Turcu, C. V. L. Pop, L. I. Ciortea
Venue: Computing and Visualization in Science (2009)

The Global random walk algorithm performs simultaneously the tracking of large collections of particles and permits massive simulations at reasonable costs. Applications were developed for transport in systems with anisotropic, non-homogeneous, and randomly distributed parameters. As a first illustration we present simulations for diffusion in human skin. Further, a case study for contaminant transport in groundwater shows that the realizations of the transport process converge in mean square limit to a Gaussian diffusion. This investigation also indicates that the use of the Kraichnan routine, based on periodic random fields, yields reliable simulations of transport in Gaussian velocity fields.
A Reader Anti-collision MAC Protocol for Dense Reader RFID System
Authors: Gyanendra Prasad Joshi, Kazi Md. Abdulla Mamun, Sung Won Kim
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In dense reader RFID system, a number of readers in the same interrogation area want to access the channel at the same time suffer from reader collision problem. In this paper, we propose a distributed reader anti-collision MAC protocol (RAMP) for dense reader environment. We extended the pulse protocol by adding multiple data channels and the channel hopping algorithm. The channel hopping algorithm helps to decide whether to hop for new channel or wait in the same channel. Also, channel utilization probability based random backoff mitigates the collision possibility in the control channel. Simulation result shows that our protocol mitigates reader's collision, hence decreases waiting time significantly than the existing RFID MAC protocol.
A Delayed Estimation Filter Using Finite Observations on Delay Interval
Authors: HyongSoon Kim, PyungSoo Kim, SangKeun Lee
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this letter, a new estimation filtering is proposed when a delay between signal generation and signal estimation exists. The estimation filter is developed under a maximum likelihood criterion using only the finite observations on the delay interval. The proposed estimation filter is represented in both matrix form and iterative form. It is shown that the filtered estimate has good inherent properties such as time-invariance, unbiasedness and deadbeat. Via numerical simulations, the performance of the proposed estimation filtering is evaluated by the comparison with that of the existing fixed-lag smoothing, which shows that the proposed approach could be appropriate for fast estimation of signals that vary relatively quickly. Moreover, the on-line computational complexity of the proposed estimation filter is shown to be maintained at a lower level than the existing one.