ppxscal/embedding_network huggingface dataset:
Is the Category-Specific Deficit for Living Things Spurious?
Authors: Matthew A. Kurbat, Martha J. Farah
Venue: Journal of Cognitive Neuroscience (1998)

Some neurological patients make more errors naming living than nonliving things. This is true even when the difficulty of naming living and nonliving things, as measured by the performance of normal subjects, is taken into account. Gaffan and Heywood (1993) argued that this apparently selective deficit for living things is spurious and offered an alternative explana tion of it in terms of the effect of noise on regression analyses. We report Monte Carlo simulations showing that, in two patients, the living things deficit cannot be accounted for this in this way. These simulations are more consistent with the claim that the recognition of living things depends on specialized mechanisms.
The polynomial degree of the Grassmannian G(1,n,q) of lines in finite projective space PG(n, q)
Authors: David G. Glynn, Johannes G. Maks, Rey Casse
Venue: Designs, Codes and Cryptography (2006)

Let G: = G(1,n,q) denote the Grassmannian of lines in PG(n,q), embedded as a point-set in PG(N, q) with $$N:=\binom{n+1}{2}-1.$$ For n = 2 or 3 the characteristic function $$\chi (\overline{G})$$ of the complement of G is contained in the linear code generated by characteristic functions of complements of n-flats in PG(N, q). In this paper we prove this to be true for all cases (n, q) with q = 2 and we conjecture this to be true for all remaining cases (n, q). We show that the exact polynomial degree of $$ \chi (\overline{G})$$ is $$(q-1)(\binom{n}{2}-1+\delta )$$ for ¿: = ¿(n, q) = 0 or 1, and that the possibility ¿ = 1 is ruled out if the above conjecture is true. The result deg( $$\chi (\overline{G}))= \binom{n}{2}-1$$ for the binary cases (n,2) can be used to construct quantum codes by intersecting G with subspaces of dimension at least $$\binom{n}{2}.$$
Proving that programs eventually do something good
Authors: Byron Cook, Alexey Gotsman, Andreas Podelski, Andrey Rybalchenko, Moshe Y. Vardi
Venue: ACM SIGPLAN Notices (2007)

In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited to properties that guarantee the absence of bad events (safety properties). Until now no formal software analysis tool has provided fully automatic support for proving properties that ensure that good events eventually happen (liveness properties). In this paper we present such a tool, which handles liveness properties of large systems written in C. Liveness properties are described in an extension of the specification language used in the SDV system. We have used the tool to automatically prove critical liveness properties of Windows device drivers and found several previously unknown liveness bugs.
Security: Bridging the Academia-Industry Gap Using a Case Study
Authors: Kirti Garg, Vasudeva Varma, K. N. Giridhar
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Security is one of the major concerns of modern software development, but there is a wide gap between the industry practice and the academic instruction. Security issues are usually not addressed in academic setup and those attempt to make it as part of their software engineering curriculum realize quickly that it is difficult to make learning happen in a conventional lecture based approach. We explored a case study centered non-conventional approach and found it to be instrumental in bridging this gap between the industry and the academia. We give a detailed methodology for using the case study and our experience, observations and result of the approach. Whole case exercise aims at creating software professionals who realize the importance of security and are well versed with the related concepts, skills and dispositions and thus handle security related challenges in a structured manner.
Supporting Secure Authentication and Privacy in Wireless Computing
Authors: Seong-Pyo Hong, Joon Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

The IEEE 802.11 standard for wireless LAN communications introduced the Wired Equivalent Privacy(WEP) protocol in an attempt to bring the security level of wireless systems closer to that of wired ones. Unfortunately, WEP falls short of accomplishing its security goals. Despite employing the well-known and believed-secure RC4 cipher, WEP contains several major security flaws. The flaws give rise to a number of attacks, both passive and active, that allow eavesdropping on, and tampering with, wireless transmissions. The IEEE 802.1x framework, what was known to have improved the IEEE 802.11b's weakness in user authentication, is a port-based authentication protocol. The IEEE 802.1x does not specify an authentication method, although the most common approach for WLANs is EAP, which is a framework for a variety of authentication methods. However, the IEEE 802.1x is also vulnerable to Denial of service and session high-jacking attacks due to the lack of AP authentication and encryption mechanism. In this paper, we propose a Wireless LAN secure system that offers secure encrypted communication and user authentications. The purpose of the WLAN secure system that this study suggests is to improve the weakness in security of IEEE 802.1x and to guarantee a secure encrypted communication. The proposed system does not allow any faking of the identity by performing a thorough mutual authentication to all associated objects. Furthermore, it provides an integrity service by encrypting EAP-SUCCESS messages with distributed a new shared-key through the key distribution mechanism when an authentication process is executed, and securing the encrypted communication by using the 128 bit-length key.
Improving Wavelet-Networks Performance with a New Correlation-based Initialisation Method and Training Algorithm
Authors: Edgar S. Garcia-Trevino, Vicente Alarcon-Aquino, Jose F. Ramirez-Cruz
Venue: Proceedings of the 15th International Conference on Computing (2006)

Wavelet-networks are inspired by both the feed-forward neural networks and the theory underlying wavelet decompositions. This special kind of networks has proved its advantages over other network schemes, particularly in approximation and prediction problems. However, the training procedure used for wavelet networks is based on the idea of continuous differentiable wavelets, but unfortunately, most of powerful and used wavelets do not satisfy this property. This paper presents a new initialisation procedure and a new training algorithm for wavelet neural-networks that improve its performance allowing the use of different kind of wavelets. To show this, comparisons are made for chaotic time series approximation between the proposed approach and the typical wavelet-network.
Multiagent simulation meets the real world
Authors: Toru Ishida
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

To realize large scale socially embedded systems, this paper proposes a multiagent-based participatory design that consists of steps called 1) participatory simulation, where scenario-guided agents and human-controlled avatars coexist in virtual space and jointly perform simulations, and 2) augmented experiment, where an experiment is performed in real space by human subjects and scenario-guided extras. In this methodology, we use production rules to describe agent models for approximating users, and multiagent scenarios to describe interaction models among services and their users. To learn agent and interaction models incrementally from simulations and experiments, we establish the participatory design loop with deductive machine learning technologies.
Fast codebook search algorithms based on tree-structured vector quantization
Authors: Chin-Chen Chang, Yu-Chiang Li, Jun-Bin Yeh
Venue: Pattern Recognition Letters (2006)

Tree-structured vector quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the selected codeword is the closest one to the input vector. Consequently, the image quality of TSVQ is worse than that of full-search VQ (FSVQ). Although researchers have proposed multipath TSVQ and DP-TSVQ to enhance the image quality, these methods are still too slow for achieving high image quality. Therefore, this study presents a novel full search equivalent TSVQ (FSE-TSVQ) to obtain efficiently the closest codeword for each input vector. FSE-TSVQ employs the triangle inequality to achieve efficient pruning of impossible codewords. Moreover, this study also develops the enhanced DP-TSVQ (EDP-TSVQ) algorithm, which achieves a better trade-off than DP-TSVQ between encoding time and image quality. EDP-TSVQ is a hybrid technique which adds DP-TSVQ's critical function to FSE-TSVQ. EDP-TSVQ always provides an image quality identical to that of DP-TSVQ, but by searching fewer codebook tree nodes. Simulation results reveal that FSE-TSVQ requires only 21-38% of the running time of FSVQ. For a high image quality application, the performance of EDP-TSVQ is always better than that of DP-TSVQ. Using the example of a codebook tree with 512 codewords, with the threshold of the critical function set to 0.6, simulation results indicate that EDP-TSVQ requires only 37% of the execution time of DP-TSVQ.
Hemispheric Processing of Categorical and Coordinate Spatial Relations in the Absence of Low Spatial Frequencies
Authors: Matia Okubo, Chikashi Michimata
Venue: Journal of Cognitive Neuroscience (2002)

Right-handed participants performed the categorical and coordinate spatial relation judgments on stimuli presented to either the left visual field - right hemisphere (LVF-RH) or the right visual field - left hemisphere (RVF-LH). The stimulus patterns were formulated either by bright dots or contrast-balanced dots. When the stimuli were bright, an RVF-LH advantage was observed for the categorical task, whereas an LVF-RH advantage was observed for the coordinate task. When the stimuli were contrast balanced, the RVF-LH advantage was observed for the categorical task, but the LVF-RH advantage was eliminated for the coordinate task. Because the contrast-balanced dots are largely devoid by of low spatial frequency content, these results suggest that processing of low spatial frequency is responsible for the right hemisphere advantage for the coordinate spatial processing.
The Audio Surveillance Eye
Authors: Hedayat Alghassi, Shahram Tafazoli, Peter Lawrence
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

In this paper we present a novel signal processing algorithm accompanied with an array structure for audio signal localization and surveillance in three dimensional space. This method, which has similarities to the eye structure, consists of a novel hemispherical microphone array with microphones on the shell and one microphone in the sphere center. A signal processing scheme utilizes parallel creation of a special closeness function for each microphone direction on the shell. Contrary to traditional algorithmic sound source localization techniques, our method is based on some simple parallel mathematical calculations in the time domain; therefore it can be easily implemented on a custom designed integrated circuit.
Local Alignments of DNA Sequences with the Connex Array
Authors: Dominique Thiebaut, Gheorghe Stefan, Mihaela Malita
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

This paper presents a heuristic for finding close to optimal solutions to the local alignment problem of two DNA sequences, and more precisely to the gene prediction problem on the Connex Array circuit, a new hierarchical parallel in-memory device. Though not optimal, the solutions generated by our algorithm compare well with those generated by other algorithms in the public domain. When aligning a probe of N symbols to a target of M symbols, the algorithm has a theoretical time complexity of O(N log(N)), with a small constant of proportionality, and requires no preprocessing of the data. However, experimental results exhibit quasi-linear time complexity.
Extending task technology fit with computer self-efficacy
Authors: Diane M. Strong, Mark T. Dishaw, D. Brent Bandy
Venue: ACM SIGMIS Database (2006)

This study is part of a stream of research that has a goal of understanding software utilization choices of users by extending and testing TTF models in a variety of domains using various methods of model estimation. In particular, this study extends a Task-Technology Fit (TTF) model by including the Computer Self-Efficacy (CSE) construct, a strategy of model extension suggested by Berthon et al. (2002). In this study, the domain is the utilization of modeling tools by business students. The TTF models are estimated using PLS. This study finds that CSE, i.e., users' beliefs in their ability to use a technology, in a TTF model increases the explanatory power of the model over one with only task characteristics, technology functionality, and the fit (interaction) between them. CSE has a direct effect on tool utilization, but no significant interaction, i.e., fit, effects.
An algorithm for reporting maximal c-cliques
Authors: F. Cazals, C. Karande
Venue: Theoretical Computer Science (2005)

Given two graphs, a fundamental task faced by matching algorithms consists of computing either the (connected) maximal common induced subgraphs ((C)MCIS) or the (connected) maximal common edge subgraphs ((C)MCES). In particular, computing the CMCIS or CMCES reduces to reporting so-called c-connected cliques in product graphs, a problem for which an algorithm has been presented in I. Koch, Fundamental study: enumerating all connected maximal common subgraphs in two graphs, Theoret. Comput. Sci. 250 (1-2), (2001) 1-30. This algorithm suffers from two problems which are corrected in this note.
Constrained beamspace MUSIC
Authors: D. A. Linebarger, R. D. DeGroat, E. M. Dowling, P. Stoica
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Constrained multiple signal classification (MUSIC) and beamspace MUSIC are similar algorithms in that they both incorporate a priori information about signal directions and involve linear transformation on the data. However, it is shown that constrained MUSIC deflates the noise subspace (assuming no out-of-sector sources). They can be used together, resulting in constrained beamspace MUSIC. The authors also perform an asymptotic variance analysis and contrast the performance of MUSIC, constrained MUSIC, beamspace MUSIC, and constrained beamspace MUSIC.
Role-based semantics for agent communication: embedding of the 'mental attitudes' and 'social commitments' semantics
Authors: Guido Boella, Rossana Damiano, Joris Hulstijn, Leendert van der Torre
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In this paper we illustrate how a role-based semantics for agent communication languages can embed the two main existing models of agent communication languages, respectively based on 'mental attitudes' and 'social commitments' semantics. These two models have been presented as incompatible approaches, but recently we illustrated for persuasion dialogues and using our normative multi-agent systems framework, that they can be seen also as complimentary ones. Independently from our own multi-agent model, in this paper we illustrate for the speech act 'inform' how the role based semantics embeds the other two semantics.
Strategies for Efficient Syntactical and Semantic Web Services
Authors: Yue Zhang, Tao Yu, Krishna Raman, Kwei-Jay Lin
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

In the future, there may be a large number of Web Services available in the world. A user will want to have an efficient and effective way to identify the appropriate Web service(s) to satisfy his needs. This paper describes several strategies, including backward service discovery using set overlapping, backward service composition using breadth-first search tree, to achieve correct and efficient Web Services discovery and composition based on syntactical matching. We also discuss how the algorithm is extended to perform semantic discovery and composition.
Distributed Architectures for High Performance and Privacy-Aware Content Generation and Delivery
Authors: Claudia Canali, Michele Colajanni, Riccardo Lancellotti
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

The current trend in the evolution of the Web is towards an every increasing demand for personalized Web contents. Tailoring Web resources to the characteristics of heterogeneous client devices and user preferences opens two main novel issues in the research area of content generation and delivery. First, the high computational cost characterizing most adaptation services requires efficient and scalable support systems. Second, adaptation services typically rely on user information that may include sensitive data. When system scalability is achieved through architectures that are distributed over a geographical area, privacy issues concerning the user profiles management become particularly critical. In this paper, we propose a distributed architecture for the Ubiquitous Web access that guarantees high performance and privacy of sensitive user information by splitting the adaptation services over the nodes of a two-level topology. We evaluate the performance and the overheads of the proposed architecture in order to understand to which extent it is convenient to distribute adaptation services over multiple nodes that are geographically distributed.
Monitoring Database Application Behavior for Intrusion Detection
Authors: Jose Fonseca, Marco Vieira, Henrique Madeira
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Database management systems (DBMS) represent the ultimate layer in preventing malicious data access or corruption and implement several security mechanisms to protect data. However these mechanisms cannot always stop malicious users from accessing data by exploiting system vulnerabilities. The aim of this paper is to propose an intrusion detection mechanism for DBMS to fill this gap. Our approach consists of a comprehensive representation of user database utilization profiles to perform concurrent intrusion detection. Prior to the detection it is necessary to define and learn these utilization profiles. Profiles are defined using a three level abstraction and learned directly from monitoring the database utilization in real conditions. The proposed mechanism is generic and can be easily implemented in commercial and open-source DBMS.
Human behavior models for agents in simulators and games: part I: enabling science with PMFserv
Authors: Barry G. Silverman, Michael Johns, Jason Cornwell, Kevin O'Brien
Venue: Presence: Teleoperators and Virtual Environments (2006)

This paper focuses on challenges to improving the realism of socially intelligent agents and attempts to reflect the state of the art in human behavior modeling with particular attention to the impact of personality/cultural values and affect as well as biology/stress upon individual coping and group decision making. The first section offers an assessment of the state of the practice and of the need to integrate valid human performance moderator functions (PMFs) from traditionally separated subfields of the behavioral literature. The second section pursues this goal by postulating a unifying architecture and principles for integrating existing PMF theories and models. It also illustrates a PMF testbed called PMFserv created for implementating and studying how PMFs may contribute to such an architecture. To date it interconnects versions of PMFs on physiology and stress; personality, cultural and emotive processes (Cognitive Appraisal-OCC, value systems); perception (Gibsonian affordance); social processes (relations, identity, trust, nested intentionality); and cognition (affect- and stress-augmented decision theory, bounded rationality). The third section summarizes several usage case studies (asymmetric warfare, civil unrest, and political leaders) and concludes with lessons learned. Implementing and interoperating this broad collection of PMFs helps to open the agenda for research on syntheses that can help the field reach a greater level of maturity. The companion paper, Part II, presents a case study in using PMFserv for rapid scenario composability and realistic agent behavior.
The influence of system characteristics on e-learning use
Authors: Keenan A. Pituch, Yao-kuei Lee
Venue: Computers Education (2006)

The benefits of an e-learning system will not be maximized unless learners use the system. This study proposed and tested alternative models that seek to explain student intention to use an e-learning system when the system is used as a supplementary learning tool within a traditional class or a stand-alone distance education method. The models integrated determinants from the well-established technology acceptance model as well as system and participant characteristics cited in the research literature. Following a demonstration and use phase of the e-learning system, data were collected from 259 college students. Structural equation modeling provided better support for a model that hypothesized stronger effects of system characteristics on e-learning system use. Implications for both researchers and practitioners are discussed.
A large-scale testbed for wireless mobile ad hoc networks
Authors: Hiraku Okada, Yasunori Owada, Yoshihiko Takahashi, Kenichi Mase
Venue: Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation characterization (2006)

A large-scale ad hoc network testbed was built at Niigata university in November 2004. This testbed has 50 nodes on the building and along streets. Each node is composed of an SH3 processor with embedded Linux and an IEEE 802.11b wireless LAN device. All nodes are connected to the control PC via the control network, which consists of a wired LAN and one-hop wireless links. Several tools to support automatic operations of experiments are provided in the testbed.
Automatic mining of fruit fly embryo images
Authors: Jia-Yu Pan, André G. R. Balan, Eric P. Xing, Agma Juci Machado Traina, Christos Faloutsos
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

We present FEMine, an automatic system for image-based gene expression analysis. We perform experiments on the largest publicly available collection of Drosophila ISH (in situ hybridization) images, showing that our FEMine system achieves excellent performance in classification, clustering, and content-based image retrieval. The major innovation of FEMine is the use of automatically discovered latent spatial "themes" of gene expressions, LGEs, in the whole-embryo context, as opposed to patterns in nearly disjoint portions of an embryo proposed in previous methods.
Songs of Comfort and Joy
Authors: David Alan Grier
Venue: Computer (2006)

The music industry's story is a vivid reminder that entire industries can fail to see shifts in the market.