ppxscal/embedding_network huggingface dataset:
Learning Object Shape: From Drawings to Images
Authors: Gal Elidan, Geremy Heitz, Daphne Koller
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We consider the important challenge of recognizing a variety of deformable object classes in images. Of fundamental importance and particular difficulty in this setting is the problem of "outlining" an object, rather than simply deciding on its presence or absence. A major obstacle in learning a model that will allow us to address this task is the need for hand-segmented training images. In this paper we present a novel landmark-based, piecewise-linear model of the shape of an object class. We then formulate a learning approach that allows us to learn this model with minimal user supervision. We circumvent the need for hand-segmentation by transferring the shape "essence" of an object from drawings to complex images. We show that our method is able to automatically and effectively learn and localize a variety of object classes.
Automatic Versus Contingent Mechanisms of Sensory-Driven Neural Biasing and Reflexive Attention
Authors: Joseph B. Hopfinger, Anthony J. Ries
Venue: Journal of Cognitive Neuroscience (2005)

Recent studies have generated debate regarding whether reflexive attention mechanisms are triggered in a purely automatic stimulus-driven manner. Behavioral studies have found that a nonpredictive "cue" stimulus will speed manual responses to subsequent targets at the same location, but only if that cue is congruent with actively maintained top-down settings for target detection. When a cue is incongruent with top-down settings, response times are unaffected, and this has been taken as evidence that reflexive attention mechanisms were never engaged in those conditions. However, manual response times may mask effects on earlier stages of processing. Here, we used event-related potentials to investigate the interaction of bottom-up sensory-driven mechanisms and top-down control settings at multiple stages of processing in the brain. Our results dissociate sensory-driven mechanisms that automatically bias early stages of visual processing from later mechanisms that are contingent on top-down control. An early enhancement of target processing in the extrastriate visual cortex (i.e., the P1 component) was triggered by the appearance of a unique bright cue, regardless of top-down settings. The enhancement of visual processing was prolonged, however, when the cue was congruent with top-down settings. Later processing in posterior temporal&ndash;parietal regions (i.e., the ipsilateral invalid negativity) was triggered automatically when the cue consisted of the abrupt appearance of a single new object. However, in cases where more than a single object appeared during the cue display, this stage of processing was contingent on top-down control. These findings provide evidence that visual information processing is biased at multiple levels in the brain, and the results distinguish automatically triggered sensory-driven mechanisms from those that are contingent on top-down control settings.
jPhase: an object-oriented tool for modeling phase-type distributions
Authors: Juan F. Pérez, Germán Riaño
Venue: Proceeding from the 2006 workshop on Tools for solving structured Markov chains (2006)

Phase-Type distributions are a powerful tool in stochastic modeling of real systems. In this paper, we describe an object-oriented tool used to represent and manipulate these distributions as computational objects. It allows the computation of multiple closure properties that can be used when modeling large systems with multiple interactions. The tool also includes procedures for fitting the parameter of a distribution from a data set and capabilities for generating random numbers from a specified distribution. This framework is built in a flexible and expandable way, and, therefore, it is not limited to the algorithms provided.
Throughput analysis in wireless networks with multiple users and multiple channels
Authors: Amrinder Arora, Fanchun Jin, Gokhan Sahin, Hosam Mahmoud, Hyeong-Ah Choi
Venue: Acta Informatica (2006)

We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incurred due to link adaptation. The contributions of this paper are twofold. Firstly, several high performance algorithms (offline and online) are developed for efficient performance in multiple user and multiple channel environment under the practicable lookahead prediction of one time slot. Secondly, the presented algorithms and heuristics are shown to be competitive by deterministic and probabilistic analyses. Our results show that a modest consumption of resources for channel prediction and link adaptation may result in a significant throughput improvement.
Using structure indices for efficient approximation of network properties
Authors: Matthew J. Rattigan, Marc Maier, David Jensen
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating many of the most important measures - such as betweenness centrality, closeness centrality, and graph diameter-requires identifying short paths in these networks. However, finding these short paths can be intractable for even moderate-size networks. We introduce the concept of a network structure index (NSI), a composition of (1) a set of annotations on every node in the network and (2) a function that uses the annotations to estimate graph distance between pairs of nodes. We present several varieties of NSIs, examine their time and space complexity, and analyze their performance on synthetic and real data sets. We show that creating an NSI for a given network enables extremely efficient and accurate estimation of a wide variety of network statistics on that network.
Improved constructions of secret sharing schemes by applying (λ, ω)-decompositions
Authors: Marten van Dijk, Tom Kevenaar, Geert-Jan Schrijen, Pim Tuyls
Venue: Information Processing Letters (2006)

By using threshold schemes, λ -decompositions were introduced by Stinson [D.R. Stinson, Decomposition constructions for secret sharing schemes, IEEE Trans. Inform. Theory IT-40 (1994) 118-125] and used to achieve often optimal worst-case information rates of secret sharing schemes based on graphs. By using the broader class of ramp schemes, (λ,ω)-decompositions were introduced in [M. van Dijk, W.-A. Jackson, K.M. Martin, A general decomposition construction for incomplete secret sharing schemes, Des. Codes Cryptogr. 15 (1998) 301-321] together with a general theory of decompositions. However, no improvements of existing schemes have been found by using this general theory. In this contribution we show for the first time how to successfully use (λ,ω)-decompositions. We give examples of improved constructions of secret sharing schemes based on connected graphs on six vertices.
Journal self-citation study for semiconductor literature: synchronous and diachronous approach
Authors: Ming-yueh Tsay
Venue: Information Processing and Management: an International Journal (2006)

The present study investigates the self-citations of the most productive semiconductor journals by synchronous (self-citing rate) and diachronous (self-cited rate) approaches. Journal's productivity of 100 most productive semiconductor journals was gathered from INSPEC database, 1978-1997 through OVID. Data of citation frequency were obtained from the Science Citation Index (SCI), Journal Citation Reports (JCR) 2001 CDROM edition by the title-by-title search. The self-citing and self-cited data were drawn from the Citing Journal Listing and the Cited Journal Listing of the JCR CDROM version 1990-2001. Self-citing and self-cited rates were determined by the method suggested by the JCR. Eighty-seven journals common to INSPEC and JCR in semiconductor were selected as the object of this study and were listed for statistical tests. The results of the present study demonstrate that high self-citing journals are usually older than low self-citing journals. In contrast to the self-citing data, the journal self-cited rate is not closely related to the publication year but reflects the characteristics of various journals. Journals with a short time interval of publication are more possible with high self-citing and self-cited rates. Journals with higher self-citing rate tend to be more productive and receive more citation than journals with lower self-citing rate. The journal self-cited rate has no association with the number of articles that a journal published and the citation it received. A journal with a higher self-citing rate tends to be cited more by itself. The mean self-citing rate is 9.59% and the mean self-cited rate is 15.03%. There is a significant difference between self-citing and self-cited rates within the same set of journals.
The use of hyper-hidden markov models in wireless channel simulation
Authors: Antonia Marie Boadi
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The transmission of multimedia over satellite, cellular or mobile wireless networks introduces impairments which degrade signal quality. This thesis proposes a channel simulation model and design philosophy that represents a shift from the use of traditional network-centric design requirements to a more comprehensive approach that encompasses perceptual quality issues. PerFEC, the Perceptually-Sensitive Forward Error Control agent, employs a flexible, adaptive coding scheme that is both quality-of-service (QoS) and quality-of-perception (QoP) configurable. PerFEC is a decision agent that uses decoder output to select an error control scheme that is appropriate for the prevailing channel conditions. The channel simulation model is based on a new construct, the Hyper-Hidden Markov Model (HHMM), whose internal states have dual interpretation: they represent the user's perceptual quality as well as an estimate of the current bit-errorrate. This layering of Hidden Markov Models provides insight into the nonlinear relationship between quality-of-service metrics and perceptual quality. 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
On the Longest Edge of Gabriel Graphs in Wireless Ad Hoc Networks
Authors: Peng-Jun Wan Chih-Wei Yi
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

In wireless ad hoc networks, without fixed infrastructures, virtual backbones are constructed and maintained to efficiently operate such networks. The Gabriel graph (GG) is one of widely used geometric structures for topology control in wireless ad hoc networks. If all nodes have the same maximal transmission radii, the length of the longest edge of the GG is the critical transmission radius such that the GG can be constructed by localized and distributed algorithms using only 1-hop neighbor information. In this paper, we assume a wireless ad hoc network is represented by a Poisson point process with mean n on a unit-area disk, and nodes have the same maximal transmission radii. We give three asymptotic results on the length of the longest edge of the GG. First, we show that the ratio of the length of the longest edge to \sqrt{{\frac{\ln n}{\pi n}}} is asymptotically almost surely equal to 2. Next, we show that for any \xi, the expected number of GG edges whose lengths are at least 2\sqrt{{\frac{\ln n + \xi}{\pi n}}} is asymptotically equal to 2e^{-\xi}. This implies that \xi\rightarrow\infty is an asymptotically almost sure sufficient condition for constructing the GG by 1-hop information. Last, we prove that the number of long edges is asymptotically Poisson with mean 2e^{-\xi}. Therefore, the probability of the event that the length of the longest edge is less than 2\sqrt{{\frac{\ln n + \xi}{\pi n}}} is asymptotically equal to \exp\left(-2e^{-\xi}\right).
Programming Execution-Time Servers in Ada 2005
Authors: A. Burns, A. J. Wellings
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

Much of the research on scheduling schemes is prevented from being used in practice by the lack of implementations that provide the necessary abstractions. An example of this is the support of execution-time servers. Apart for a single mechanism (the Sporadic Server), which is defined in the POSIX standard, these important building blocks are not available to the system developer. Over the last few years, we have been developing the mechanisms necessary to construct execution-time servers from within an Ada context. Versions of these have now been incorporated in the Ada 2005 standard. In this paper, we show how the mechanisms can be used to construct the Deferrable and Sporadic servers.
Storing RSA Private Keys In Your Head
Authors: Taisya Krivoruchko, James Diamond, Jeff Hooper
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

An issue when using the RSA public-key system is that for reasonable levels of security, both the public key and the private key must be quite large. Since few people are capable of memorizing a 1024-bit private key, most people must store this number on a computer hard drive or other digital storage device. There are (at least) three problems with this; the first is that if your computer is even temporarily compromised, your private key could be stolen. The second is that if you are away from your computer (and don't have your key on a portable storage device) but need your private key to access some resource, you are unable to do so. The third is that your key could be irrevocably lost because of hardware problems. This paper describes a way of generating a public/private RSA key pair from a passphrase to overcome these problems. Although the paper's focus is on the generation of RSA keys, the process can be applied to any cryptosystem (symmetric or asymmetric) which relies on random data for generating keys.
Robust Multi-Pedestrian Tracking in Thermal-Visible Surveillance Videos
Authors: Alex Leykin, Riad Hammoud
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In this paper we introduce a system to track pedestrians using a combined input from RGB and thermal cameras. Two major contributions are presented here. First is the novel model of the scene background where each pixel is represented as a multi-modal distribution with the changing number of modalities for both color and thermal input. We demonstrate how to eliminate the influence of shadows with this type of fusion. Second, based on our background model we introduce a pedestrian tracker designed as a particle filter. We further develop a number of informed reversible transformations to sample the model probability space in order to maximize our model posterior probability. The novelty of our tracking approach also comes from a way we formulate observation likelihoods to account for 3D locations of the bodies with respect to the camera and occlusions by other tracked human bodies as well as static objects. The results of tracking on color and thermal sequences demonstrate that our algorithm is robust to illumination noise and performs well in the outdoor environments.
Further evidence on shareholder wealth effects of announcements for newly created CIO positions
Authors: Liming Guan, Steve G. Sutton, C. Janie Chang, Vicky Arnold
Venue: ACM SIGMIS Database (2006)

Chatterjee, Richardson and Zmud (2001) provided evidence of abnormal stock returns associated with the announcements of new CIO positions, indicating a positive reaction in the stock market to the announcements. However, an examination of the behavior of analysts who follow the firms used in the Chatterjee et al. sample finds that just over 50% of the firms actually had analysts regularly following them; and the vast majority either reflected no changes in earnings forecasts or experienced a downward adjustment. A systematic reexamination of the results reveals the following: (1) firms not tracked by analysts demonstrate positive abnormal returns at the event date; (2) Chatterjee et al.'s findings of positive abnormal returns from new CIO position announcements appear to be driven by the sub-sample of firms not tracked by analysts; (3) analyst tracked firms generally do not yield abnormal returns at the event date but they do exhibit abnormal returns in the days before the announcement indicating analysts may be using leaked information from management; and (4) despite apparently disclosing private information from management to their clients, analysts do not disclose this information through revisions of earnings forecasts. Overall, our results significantly strengthen the understanding of the phenomenon while further supporting Chatterjee et al.'s conclusion that new CIO position announcements are important to the capital markets.
Discontinuous Region Growing Scheme for Preliminary Detection of Tumor in MRCP Images
Authors: Rajasvaran Logeswaran, Chikkannan Eswaran
Venue: Journal of Medical Systems (2006)

Tumors are generally difficult to detect in Magnetic Resonance (MR) images as they can be of varying intensities and do not appear as clear structures on these images. This difficulty is more prominent in MR Cholangiopancreatography (MRCP), which is the MR technology using a special sequence of T2-weighted imaging to identify the biliary tract, pancreatic duct, and gallbladder in the liver region, as MRCP images are more noisy in nature and are acquired for a more focused area with too much flexibility in position orientation for convenient computer-aided diagnosis. Based on the principle that the tumor mass manifests itself as blockage of the biliary tree structure, this paper introduces a technique that uses a region growing algorithm to identify discontinuities in the biliary tree as a means to preliminary detection of a possible tumor, in a fashion similar to the visual observation used by most radiologists in making their preliminary diagnosis. Through the use of appropriate image normalization, watershed segmentation, thresholding, rule-based region growing, and region analysis, the proposed technique is shown in this paper to be successful in identifying MRCP images with liver carcinoma from those with normal liver. Acquisition standardization, interactive image selection, and optimum image orientation will further enhance the accuracy of this proposed scheme for use in aiding clinical diagnosis at medical institutions.
Analysis and Extraction of Season Features in Natural Scenes for Retrieval
Authors: Kun Huang, Maosheng Lai
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

Most of the current image database systems depend on visual content to index images, which only provide a partial solution to the image retrieval problem. Natural Scenes are used popularly in our daily lives, which could always cause our strong feelings and senses. This paper discusses how to index natural scenes with season features, one of affective features, to improve the accuracy of image indexing and makes it more convenient to seek them. According to colorful natural scenes' characteristics, it develops sky exclusion plus 1/2 area analysis to extract color features. At the same time, it carries out investigations to collect users' impressions. Then, based on two kinds of features above, it establishes the mapping between color and season features by multiple linear regression, which could be used to index images automatically. Finally, through experiments the mapping is testified valid and correct to forecast and index the season features.
Inflected Words Translation on Japanese-to-Korean Machine Translation
Authors: Jung-In Kim, Kang-Hyuk Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

As well-known, there are many syntactic similarities between Japanese and Korean language. These similarities allow us to build Japanese-Korean translation systems without depending too much on sophisticated syntactic analysis and semantic analysis. To further improve translation accuracy, we have been developing a Japanese-Korean translation system using these similarities for several years. However, there still remain some problems with regard to translation of inflected words, processing of multitranslatable words and so on. In this paper, we propose a new method for Japanese-Korean machine translation by using the relationships of two neighboring words. To solve the problems, we investigate the connection rules of auxiliary verb priority. And we design the translation table, which consists of entry tables and connection form tables. For unambiguous words, we can translate a Japanese word to the corresponding Korean word in terms of direct-matching method by consulting the only entry table. Otherwise, we have to evaluate the connection value computed from connection form tables and then we can select the most appropriate target word.
Security Attack Ontology for Web Services
Authors: Artem Vorobiev, Jun Han
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Web services (WS) have become a significant part of the Web because of such attractive features as simple to use, platform independence, and XML/SOAP support. However, these features make WS vulnerable to many new and inherited old security threats. Semantic WS, which are capable of publishing semantic data about their functional and nonfunctional properties, add even more security issues. Now, it becomes easier to attack WS because their semantic data is publicly available. To register and prevent these attacks, especially distributed attacks, new distributed firewalls and intrusion detection systems (F/IDS) have to be applied. However, these F/IDS can be developed by different vendors and they do not have the way to cooperate with each other. This problem can be solved if various F/IDS share a common vocabulary, which can be based on ontologies, to allow them to interact with each other. In this paper, we describe WS security threats and state that they have to be analysed and classified systematically in order to allow the development of better distributed defensive mechanisms for WS using F/IDS. We choose ontologies and OWL/OWL-S over taxonomies because ontologies allow different parties to evolve and share a common understanding of information which can be reasoned and analysed automatically. We develop the security attack ontology for WS and illustrate the benefits of using it with an example.