ppxscal/embedding_network huggingface dataset:
Elimination of quantifiers and undecidability in spatial logics for concurrency
Authors: Luís Caires, Etienne Lozes
Venue: Theoretical Computer Science (2006)

The introduction of spatial logics in concurrency is motivated by a shift of focus from concurrent systems towards distributed systems. Aiming at a deeper understanding of the essence of dynamic spatial logics, we study a minimal spatial logic without quantifiers or any operators talking about names. The logic just includes the basic spatial operators void, composition and its adjunct, and the next step modality; for the model we consider a tiny fragment of CCS. We show that this core logic can already encode its own extension with quantification over actions, and modalities for actions. From this result, we derive several consequences. Firstly, we establish the intensionality of the logic, we characterize the equivalence it induces on processes, and we derive characteristic formulas. Secondly, we show that, unlike in static spatial logics, the composition adjunct adds to the expressiveness of the logic, so that adjunct elimination is not possible for dynamic spatial logics, even quantifier-free. Finally, we prove that both model-checking and satisfiability problems are undecidable in our logic. We also conclude that our results extend to other calculi, namely the π-calculus and the ambient calculus.
A Limit to the Speed of Processing in Ultra-Rapid Visual Categorization of Novel Natural Scenes
Authors: Michèle Fabre-Thorpe, Arnaud Delorme, Catherine Marlot, Simon Thorpe
Venue: Journal of Cognitive Neuroscience (2001)

The processing required to decide whether a briefly flashed natural scene contains an animal can be achieved in 150 msec (Thorpe, Fize, & Marlot, 1996). Here we report that extensive training with a subset of photographs over a 3-week period failed to increase the speed of the processing underlying such Rapid Visual Categorizations: Completely novel scenes could be categorized just as fast as highly familiar ones. Such data imply that the visual system processes new stimuli at a speed and with a number of stages that cannot be compressed. This rapid processing mode was seen with a wide range of visual complex images, challenging the idea that short reaction times can only be seen with simple visual stimuli and implying that highly automatic feed-forward mechanisms underlie a far greater proportion of the sophisticated image analysis needed for everyday vision than is generally assumed.
Coloring copoints of a planar point set
Authors: Walter Morris
Venue: Discrete Applied Mathematics (2006)

To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gons in the point set. We prove an upper bound of 2k...1 on the size of a planar point set for which the graph has chromatic number k, matching the bound conjectured by Szekeres for the clique number. Constructions of Erdös and Szekeres are shown to yield graphs that have very low chromatic number. The constructions are carried out in the context of pseudoline arrangements.
Programmable blind adaptive spatial filtering
Authors: W. A. Gardner, J. L. Schenck, S. V. Schell
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

In wireless communications, including cellular communication systems, spread spectrum overlay systems, and signals intelligence applications, the degradation caused by rapidly time-varying multipath and unknown co-channel interference can be reduced by adaptive spatial filtering using antenna arrays. In this paper we propose a flexible framework for adapting a spatial filter to extract signals of interest (SOIs) while rejecting signals not of interest (SNOIs) without using a training signal, array calibration data, or knowledge of spatial characteristics of the desired or interfering signals. The generic method within this framework exploits user-selected properties of the SOIs and/or SNOIs to transform the received data set into a new set in which the SOIs are more highly correlated between the two sets than are the SNOIs. The framework then applies the method of canonical correlation analysis to the original and transformed data sets to obtain a linear combining weight vector that performs the spatial filtering. Simulation results illustrate the performance of algorithms developed within the new framework.
Characterizing multi-way interference in wireless mesh networks
Authors: Saumitra M. Das, Dimitrios Koutsonikolas, Y. Charlie Hu, Dimitrios Peroulis
Venue: Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation characterization (2006)

Wireless mesh networks (WMNs) have been proposed as a solution for ubiquitous last-mile broadband access. A critical limiting factor for many WMN protocols in realizing their throughput potential is the interference between nodes in the WMN. Understanding and characterizing such interference is important for a variety of purposes such as channel assignment, route selection, and fair scheduling. Instead of using ad hoc heuristics, a recent study proposed characterizing interference in a WMN by measuring two-way interference, i.e., interference between each pair of communicating links.In this paper, we study the extent of multi-way interference, i.e., the interference caused by multiple transmitters to a communicating link. We find through simulations and through measurements of a 32-node wireless testbed that even if these transmitters individually do not interfere significantly with a given communicating link, simultaneous transmissions of them have the potential to significantly affect the throughput of the communicating link. This implies that pairwise interference measurements may be optimistic when used to drive protocols in wireless mesh networks. Encouragingly, we find that this phenomenon, although significant when it occurs, is not widespread. In particular, multi-way interference caused significant additional throughput degradation compared to pairwise interference to a small fraction of the links in the testbed over our measurement period. In addition, we find that there is a strong correlation between the impact of multi-way interference and the quality of the link under consideration. We conclude with recommendations on how protocols should take multi-way interference into account.
A similarity based approach for integrated Web caching and content replication in CDNs
Authors: Konstantinos Stamos, George Pallis, Charilaos Thomos, Athena Vakali
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

Web caching and content replication techniques emerged to solve performance problems related to the Web. We propose a generic non-parametric heuristic method that integrates both techniques under a CDN. We provide experimentation showing that our method outperforms the so far separate implementations ofWeb caching and content replication. Moreover, we show that the performance improvement compared with an existing algorithm is significant. We test all these techniques in a simulation environment under a flash crowd event and a workload of a typical lightweighted CDN operation.
Answering tree pattern queries using views
Authors: Laks V. S. Lakshmanan, Hui Wang, Zheng Zhao
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

We study the query answering using views (QAV) problem for tree pattern queries. Given a query and a view, the QAV problem is traditionally formulated in two ways: (i) find an equivalent rewriting of the query using only the view, or (ii) find a maximal contained rewriting using only the view. The former is appropriate for classical query optimization and was recently studied by Xu and Ozsoyoglu for tree pattern queries (TP). However, for information integration, we cannot rely on equivalent rewriting and must instead use maximal contained rewriting as shown by Halevy. Motivated by this, we study maximal contained rewriting for TP, a core subset of XPath, both in the absence and presence of a schema. In the absence of a schema, we show there are queries whose maximal contained rewriting (MCR) can only be expressed as the union of exponentially many TPs. We characterize the existence of a maximal contained rewriting and give a polynomial time algorithm for testing the existence of an MCR. We also give an algorithm for generating the MCR when one exists. We then consider QAV in the presence of a schema. We characterize the existence of a maximal contained rewriting when the schema contains no recursion or union types, and show that it consists of at most one TP. We give an efficient polynomial time algorithm for generating the maximal contained rewriting whenever it exists. Finally, we discuss QAV in the presence of recursive schemas.
High-Speed Software Development Practices: What Works, What Doesn't
Authors: Richard Baskerville, Balasubramaniam Ramesh, Linda Levine, Jan Pries-Heje
Venue: IT Professional (2006)

Increasingly short software development cycles have forced software companies and engineers tostrike a balance between informal development--in Internet-time--and more traditional agile andplan-driven methods. The authors review six common practices and how they are blended to maximizetime-sensitive development.
Control of spatial structures in a semiconductor-gas discharge system with a semi-insulating GaAs cathode
Authors: E. L. Gurevich, Y. A. Astrov, H.-G. Purwins
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

Nonlinear current transport in transversely extended gas discharge system with a semi-insulating GaAs cathode is studied. The emerging spatial patterns appear in the semiconductor electrode, while the application of a thin gas-discharge gap allows to visualize the patterns. Sequences of scenarios in the pattern formation under changing control parameters are presented. It is experimentally shown that the dynamics of the structure is not noticeably influenced by inhomogeneities of the experimental system. Among results obtained, variation of scenarios under changing the temperature of the GaAs electrode are presented.
3-D Display of the Wall Motion for Regional Cardiac Muscle from Ultrasonic B-mode Image -Wall Motion of Thickness, Thickening Rate using Contour of Inner and Outer Wall-
Authors: Soohyo YANG, Shinji TSURUOKA, Tsuyoshi SHINOGI, Hiroharu KAWANAKA, Wataru OHYAMA, Fumitaka KIMURA, Tetsushi WAKABAYASHI, Kiyotsugu SEKIOKA
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

We have developed extracting the inner and outer walls of the cardiac muscle from a set of ultrasonic B-mode images. In this paper, we propose a new 3-D (radius, angle and time) display method of the motion function on the inner wall to evaluate the motion of the myocardium objectively. Its method displays the time transition of a cardiac wall during one cardiac cycle, and it is colored the thickness or the thickening rate of the myocardium on the surface of the 3-D object. The inner and outer walls of the heart are extracted from a set of ultrasonic B-mode Images. We implemented 3-D display system using C language and DirectX 3D in MS-Windows. We calculate the position of the points for 3-D display from the contour lines of the cardiac muscle by the cubic spline curve. The curve connects smoothly between one point and the other one point. And we found the thickness and thickening rate by using the contour lines of the cardiac muscle. We define the thickness by the shortest distance between the outer wall and the inner wall, and we calculate the thickness rate from the obtained thickness. We add the rotation view of the 3-D object to see the every side of myocardium. We confirmed the usefulness of our 3-D display.
Integrating Data Grid and Web Services for E-Science Applications: A Case Study of Exploring Species Distributions
Authors: Jianting Zhang, Ilkay Altintas, Jing Tao, Xianhua Liu, Deana D. Pennington, William K. Michener
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Data Grid and Web Services are among the advanced computing technologies that are available to support scientists and scientific applications. We use Kepler scientific workflow system to integrate the two popular technologies for e-science applications. A prototype system for exploring species distribution patterns has been developed for demonstration purposes by using data grid resources and a similarity-based clustering Web service in conjunction with Geographical Information System (GIS) based spatial visualization resources in Kepler.
Automated analysis and verification of agent behavior
Authors: Tibor Bosse, Dung N. Lam, K. Suzanne Barber
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Comprehending and analyzing agent behavior is an arduous task due to complexities in agent systems and sophistication of agent behaviors, in addition to the common difficulties with any complex software system. This paper presents an integrated approach for the analysis and verification of behaviors of agent-based systems. The approach is a result of collaboration between the Tracer Tool and the TTL Checker, which together automate the analysis and verification of agents in an implemented agent system with the aim of aiding the user in redesigning, debugging, and maintaining the software system. The Tracer Tool ensures that the user's comprehension of the system behavior is accurate and provides explanations of anomalous behavior, which can be detected as a failed behavioral property by the TTL Checker. The integrated approach has been applied successfully in a case study in the domain of Unmanned Aerial Vehicles.
Simulation based evaluation of information-centric supply chains
Authors: Srinagesh Gavirneni
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In this paper we evaluate, via the use of simulation, information-centric design of three supply chains that are ubiquitous in operations management literature. With emphasis on inventories, we show how such a redesign of the supply chains can significantly enhance the benefit from information flows that are commonplace in the current business world. The underlying analysis is in the realm of stochastic non-stationary capacitated inventory control and the mathematical intractability behooves us to make extensive use of simulation. We postulate that the lack of such information centric re-designing of supply chains is one of the main reasons behind the failure, reported in popular press, of most information gathering projects in the industry.
Secure implementations of typed channel abstractions
Authors: Michele Bugliesi, Marco Giunti
Venue: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007)

The challenges hidden in the implementation of high-level process calculi into low-level environments are well understood [3]. This paper develops a secure implementation of a typed pi calculus, in which capability types are employed to realize the policies for the access to communication channels. Our implementation compiles high-level processes of the pi-calculus into low-level principals of a cryptographic process calculus based on the applied-pi calculus [1]. In this translation, the high-level type capabilities are implemented as term capabilities protected by encryption keys only known to the intended receivers. As such, the implementation is effective even when the compiled, low-level principals are deployed in open contexts for which no assumption on trust and behavior may be made. Our technique and results draw on, and extend, previous work on secure implementation of channel abstractions in a dialect of the join calculus [2]. In particular, our translation preserves the forward secrecy of communications in a calculus that includes matching and supports the dynamic exchange of write and read access-rights among processes. We establish the adequacy and full abstraction of the implementation by contrasting the untyped equivalences of the low-level cryptographic calculus, with the typed equivalences of the high-level source calculus.
Vise: A System for Visualizing Salient Events in a Text Stream
Authors: Gabriel Pui Cheong Fung
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

In this paper, we present a system called Vise for visualizing salient events in a text stream according to the users' interests. A text stream is a sequence of chronological ordered documents. News articles, email and newsgroup postings are some typical examples of text stream. Through Vise, a user can visualize the events resides in a text stream by providing a set of keywords that are related to the events. A graph will be displayed to denote for the underlying patterns of the events. Yet, retrieving events in a text stream is a very difficult task due to the sparsity and noisiness of the features (keywords) in there. We solve these problems with the help of binomial distribution and some statis- tical theories. We have archived a stream of two-year news articles to evaluate the usability and the effec- tiveness of Vise. According to a subjective evaluation, the patterns of the events identified are justifiable and match our expectation. These favorable results indi- cated that our proposed system is highly effective and practical.
A PCA Based Visual DCT Feature Extraction Method for Lip-Reading
Authors: Xiaopeng Hong, Hongxun Yao, Yuqi Wan, Rong Chen
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

This paper proposes a PCA based method to reduce the dimensionality of DCT coefficients for visual only lip-reading systems. A three-stage pixel based visual front end is adopted. First, DCT or block-based DCT features are extracted. Second, Principal Component Analysis is applied for dimension reduction. Finally, all the feature vectors are normalized into a uniform scale. This work investigates this three-stage method, comparing with PCA and two DCT based approaches whose features are selected manually. In the latter manner, PCA coefficients are selected according to energy while the reduction of DCT coefficients leans to the left components in the left-top corner. Experiments prove that the dimension reduction task based on PCA does improve the recognition accuracy when the final dimension is below a certain value. They also show that DCT and block-based DCT work similarly for lip reading task, outperforming PCA slightly.
JSSPrediction: a Framework to Predict Protein Secondary Structures Using Integration
Authors: L. Palopoli, S. E. Rombo, G. Terracina, G. Tradigo, P. Veltri
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Identifying protein secondary structures is a difficult task. Recently, a lot of software tools for protein secondary structure prediction have been produced and made available on-line, mostly with good performances. However, prediction tools work correctly for families of proteins, such that users have to know which predictor to use for a given unknown protein. We propose a framework to improve secondary structure prediction by integrating results obtained from a set of available predictors. Our contribution consists in the definition of a two phase approach: (i) select a set of predictors which have good performances with the unknown protein family, and (ii) integrate the prediction results of the selected prediction tools. Experimental results are also reported.
Table Detection in Online Ink Notes
Authors: Zhouchen Lin, Junfeng He Zhicheng Zhong Rongrong Wang Heung-Yeung Shum
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

In documents, tables are important structured objects that present statistical and relational information. In this paper, we present a robust system which is capable of detecting tables from free style online ink notes and extracting their structure so that they can be further edited in multiple ways. First, the primitive structure of tables, i.e., candidates for ruling lines and table bounding boxes, are detected among drawing strokes. Second, the logical structure of tables is determined by normalizing the table skeletons, identifying the skeleton structure, and extracting the cell contents. The detection process is similar to a decision tree so that invalid candidates can be ruled out quickly. Experimental results suggest that our system is robust and accurate in dealing with tables having complex structure or drawn under complex situations.
Speech/Music Discrimination Based on Spectral Peak Analysis and Multi-layer Perceptron
Authors: Ji-Soo Keum, Hyon-Soo Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

This study presents a new Speech/Music discrimination method based on spectral peak feature and Multilayer Perceptron. The focus was on feature extraction that reflects spectral peak duration characteristics and high performance using small number of train dataset. Spectral peak features were extracted from audio spectral peak tracks and the feature was normalized by length of segment. Then, we grouping the frequency channel to reflect the spectral distribution. For train, only 25 seconds of speech (Korean) and 50 seconds of music are used. This method was evaluated on speech and music for 24,258 seconds of audio data. An average accuracy was 96.58% for speech and 91.82% for music. The results of this experiment found that proposed method was suitable for Speech/Music discrimination.
The Win-Win Optimization for the Supply Chain Supernetwork with Electronic Commerce Based on the Variational Inequalities
Authors: Guangfen Yang, Zhiping Wang, Youjun Wang
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

In this paper, we develop a framework for the modeling, analysis, and computation of solutions to a supply chain supernetwork with electronic commerce. The association processes between the manufacturers and the consumers are accomplished through the Internet. Manufacturers are assumed to produce homogeneous materiality products, faced with the criteria --the maximum profit. And the demand markets can purchase the products from the manufacturers according to their economic status through Internet. Then, logistics department union is the combination of a manufacturer's order management, inventory, transportation, warehousing, materials handling, and packaging as integrated throughout the supply chain supernetwork. Hereon this base, the optimality conditions for the manufacturers, the logistics department union and the demand markets are established using the variational inequality. Then we describe the win-win situation for the supply chain supernetwork model; get the stationary points for this situation. And an example is illustrated to validate the utility of the model in the last part.