132,948 research outputs found
R. N. Burney, alias William Turner, alias C. D. Rhine heart, alias J. T. Baker; C. G. Meyers, alias George E. Spencer
No full textDETECTIVE BUREAU
WASHINGTON, D. C. AUGUST 13, 1902.
WANTED FOR
GRAND LARCENY
R. N. Burney, alias William Turner, alias C. D. Rhine heart, alias J. T. Baker, white, 35 years old, 5 feet 7 or 8, 150 pounds, light complexion, dark brown hair, high cheek bones, smooth face, steel gray suit, black fedora hat, low quarter patent leather shoes, horseshoe scarf pin with large stone in center.
C. G. Meyers, alias George E. Spencer, white, 35 to 40 years old, S feet 9 or 10, dark complexion, dark curly hair, heavy sandy mustache clipped on ends, may have been dyed, blue serge suit, plaid shirt, black fedora hat, low quarter patent leather shoes.
On Friday, the 8th instant, they visited the tailoring establishments of
M. F. Seltz, 1332 F Street, N. W., and Owen Owen, 423 Eleventh Street, N. W., this city, each ordering a suit of clothes valued at 3 was paid, and directed that when finished, the suits be sent to their address C. 0. D. on Tuesday, 12th instant. Upon arrival of the porter, they obtained possession of the clothing under pretense of trying the suits on, and then made their escape through the rear door.
Kindly have diligent inquiry made for these men and if found in your jurisdiction cause their arrest and telegraph-
R ICHARD SYLVESTER,
Superintendent of Polic
John Seymour, alias Barton, alias Fred Johnson, alias Wilson, alias Moore
No full textHEADQUARTERS OF THE METROPOLITAN POLICE. DETECTIVE BUREAU,
WASHINGTON, D. C., JUNE 15, 1901
WANTED FOR HOUSEBREAKING AT NIGHT
John Seymour, alias Barton, alias Fred Johnson, alias Wilson, alias Moore, white, 21 to 25 years old, 5 feet 4 or 5 inches tall, 140pounds, smooth face, GRAY PATCH OF HAIR SIZE OF DOLLAR OR HALF DOLLAR ON LEFT SIDE OF HEAD WHICH IS VERV NOTICABLE When last seen wore black box coat, dark pants, black derby hat tan shoes. Will likely beat his way on freight trains and he may be found around cheap lodging houses and associates with hobos.
Kindly have diligent inquiry made for this man, and if in your jurisdiction cause his arrest and immediately telegraph-
R ICHARD SYLVESTER,
Major and Superintendent.
PLEASE POS
Genetic Algorithm Assisted Minimum Bit Error Rate Multiuser Detection in Multiple Antenna Aided OFDM
No full textThe family of minimum bit error rate (MBER) multiuser detectors (MUD) is capable of outperforming the classic minimum mean-squared-error (MMSE)MUDin term of the achievable bit-error rate (BER) owing to directly minimising the BER cost function. In this paper, we will invoke genetic algorithms (GA) for finding the optimum weight vectors of the MBERMUDin the context of multipleantenna aided multi-user OFDM
Also Bob Nightengale, alias Bob Callahan
No full textArrest Tom Israel, alias Tom Williams, 22 years old, about five feet five inches tall, weighs 130 to 135 pounds, smooth boyish face, light complexion, large blue eyes; scar mark over eye, sloping diagonally downward toward the outer corner, and extending down into eyebrow, scar shows a bluish or dark tinge; has bald spots on back of head claims to be both machinist and tailor; wears a short brown overcoat soft black crusher hat, may have on derby hat. Wanted for burglary. Also, Bob Nightengale, alias Bob Callahan, about 21 to 22 years old, about five feet five inches tall; square, heavy built; long body and short legs; sma1l, dark eyes, close together: dark complexion, black hair, red face, shows effect of drink; may have small, black mustache; big mouth; rough, irregular teeth; high cheek bones, slim face, peaked. chin; had on light pants, and black coat and vest, and
soft hat, no overcoat. Wanted for forger
CHARLES HYLEBERT alias Hyle, alias Red Hyle, alias C. L. Douglass
No full textWANTED FOR GRAND LARCENY
AND HOUSEBREAKING
CHAS. HYLEBERT alias Hyle, alias Red Hyle, alias C. L. Douglass.
Arrest for Grand Larceny, Chas. Hylebert, alias Hyle, alias Red Hyle, a well-known "hotel thief." He is white; 47 years old; 5 feet 6 2 inches tall; 155 pounds weight; reel hair; sanely complexion; light eyes; large feet; legs slightly bowed ; who on Monday, the 8th instant, registered at a hotel of this city as C. L. DOUGLASS, TOMBSTONE, ARIZ., and between 6.30 and 7.30 P. M. robbed three rooms of the following described jewelry ,
Diamond Pendant, set with 16 or 18 diamonds, set on gold bar, with small link chain, cost, 30. Gold Chain Bracelet, set with one diamond, fine gold chain with balls on end attached, cost, 12. Baby's Gold Necklace, with gold heart set with ruby attached, cost, S6. Plain Gold Wire Bracelet. cost, 12. five small Child's Gold Rings, cost, $12. Two Gold Shirt Studs.
Please have diligent enquiry made among pawnbrokers, second-hand dealers, and others, for the above-described property, and cause the arrest of anyone offering the same for pawn or sale, and immediately telegraph-
RICHARD SYLVESTER,
Major and Superintendent.
Hotel proprietors and clerks are respectfully asked to co-operate with us in securing the arrest of this man, and should there be a guest at your house whom you think likely to be Hyle, alias Douglass, immediately notify your police authorities
Flexible Alias Protection
No full text. Aliasing is endemic in object oriented programming. Because an object can be modified via any alias, object oriented programs are hard to understand, maintain, and analyse. Flexible alias protection is a conceptual model of inter-object relationships which limits the visibility of changes via aliases, allowing objects to be aliased but mitigating the undesirable e#ects of aliasing. Flexible alias protection can be checked statically using programmer supplied aliasing modes and imposes no runtime overhead. Using flexible alias protection, programs can incorporate mutable objects, immutable values, and updatable collections of shared objects, in a natural object oriented programming style, while avoiding the problems caused by aliasing. 1 Introduction I am who I am; I will be who I will be. Object identity is the foundation of object oriented programming. Objects are useful for modelling application domain abstractions precisely because an object 's identity always remains the same d..
roots
No full textThe comet assay is a sensitive method for the evaluation of DNA damages and DNA repair capacity at single-cell level. Allium cepa is a well-established plant model for toxicological studies. The aim of this scoping review was to investigate the recent application of the comet assay in Allium cepa root cells to assess the genotoxicity. To explore the literature a search was performed selecting articles published between January 2015 and February 2023 from Web of Science, PubMed, and Scopus databases using the combined search terms "Comet assay" and "Allium cepa". All the original articles that applied the comet assay to Allium cepa root cells were included. Of the 334 records initially found, 79 articles were identified as meeting the inclusion criteria. Some studies reported results for two or more toxicants. In these cases, the data for each toxicant were treated separately. Thus, the number of analyzed toxicants (such as chemicals, new materials, and environmental matrices) was higher than the number of selected papers and reached 90. The current use of the Allium-comet assay seems to be directed towards two types of approach: the direct study of the genotoxicity of compounds, mainly biocides (20% of analyzed compounds) and nano- and microparticles (17%), and assessing a treatment's ability to reduce or eliminate genotoxicity of known genotoxicants (19%). Although the genotoxicity identified by the Allium-comet assay is only one piece of a larger puzzle, this method could be considered a useful tool for screening the genotoxic potential of compounds released into the environment
Theory and realization of novel algorithms for random sampling in digital signal processing
No full textRandom sampling is a technique which overcomes the alias problem in regular sampling. The randomization, however, destroys the symmetry property of the transform kernel of the discrete Fourier transform. Hence, when transforming a randomly sampled sequence to its frequency spectrum, the Fast Fourier transform cannot be applied and the computational complexity is N(^2). The objectives of this research project are (1) To devise sampling methods for random sampling such that computation may be reduced while the anti-alias property of random sampling is maintained : Two methods of inserting limited regularities into the randomized sampling grids are proposed. They are parallel additive random sampling and hybrid additive random sampling, both of which can save at least 75% of the multiplications required. The algorithms also lend themselves to the implementation by a multiprocessor system, which will further enhance the speed of the evaluation. (2) To study the auto-correlation sequence of a randomly sampled sequence as an alternative means to confirm its anti-alias property : The anti-alias property of the two proposed methods can be confirmed by using convolution in the frequency domain. However, the same conclusion is also reached by analysing in the spatial domain the auto-correlation of such sample sequences. A technique to evaluate the auto-correlation sequence of a randomly sampled sequence with a regular step size is proposed. The technique may also serve as an algorithm to convert a randomly sampled sequence to a regularly spaced sequence having a desired Nyquist frequency. (3) To provide a rapid spectral estimation using a coarse kernel : The approximate method proposed by Mason in 1980, which trades the accuracy for the speed of the computation, is introduced for making random sampling more attractive. (4) To suggest possible applications for random and pseudo-random sampling : To fully exploit its advantages, random sampling has been adopted in measurement Random sampling is a technique which overcomes the alias problem in regular sampling. The randomization, however, destroys the symmetry property of the transform kernel of the discrete Fourier transform. Hence, when transforming a randomly sampled sequence to its frequency spectrum, the Fast Fourier transform cannot be applied and the computational complexity is N"^. The objectives of this research project are (1) To devise sampling methods for random sampling such that computation may be reduced while the anti-alias property of random sampling is maintained : Two methods of inserting limited regularities into the randomized sampling grids are proposed. They are parallel additive random sampling and hybrid additive random sampling, both of which can save at least 75% , of the multiplications required. The algorithms also lend themselves to the implementation by a multiprocessor system, which will further enhance the speed of the evaluation. (2) To study the auto-correlation sequence of a randomly sampled sequence as an alternative means to confirm its anti-alias property : The anti-alias property of the two proposed methods can be confirmed by using convolution in the frequency domain. However, the same conclusion is also reached by analysing in the spatial domain the auto-correlation of such sample sequences. A technique to evaluate the auto-correlation sequence of a randomly sampled sequence with a regular step size is proposed. The technique may also serve as an algorithm to convert a randomly sampled sequence to a regularly spaced sequence having a desired Nyquist frequency. (3) To provide a rapid spectral estimation using a coarse kernel : The approximate method proposed by Mason in 1980, which trades the accuracy for the speed of the computation, is introduced for making random sampling more attractive. (4) To suggest possible applications for random and pseudo-random sampling : To fully exploit its advantages, random sampling has been adopted in measurement instruments where computing a spectrum is either minimal or not required. Such applications in instrumentation are easily found in the literature. In this thesis, two applications in digital signal processing are introduced. (5) To suggest an inverse transformation for random sampling so as to complete a two-way process and to broaden its scope of application. Apart from the above, a case study of realizing in a transputer network the prime factor algorithm with regular sampling is given in Chapter 2 and a rough estimation of the signal-to-noise ratio for a spectrum obtained from random sampling is found in Chapter 3. Although random sampling is alias-free, problems in computational complexity and noise prevent it from being adopted widely in engineering applications. In the conclusions, the criteria for adopting random sampling are put forward and the directions for its development are discussed
60.00 REWARD- FOR·JACK HOLLY, Alias JOHN MURPHY, Alias J. D. SMITH.
No full text60.00 for the Arrest and detention, until an Officer from the Penitentiary can reach him, of Jack Holly, and I will pay 10.00 for each one of them. Please make every effort to capture these men. Arrest and Notify
W. W. PAINTFR, Sheriff
Comanche County,
Lawton Oklahom
MeSH term explosion and author rank improve expert recommendations
No full textInformation overload is an often-cited phenomenon that reduces the productivity, efficiency and efficacy of scientists. One challenge for scientists is to find appropriate collaborators in their research. The literature describes various solutions to the problem of expertise location, but most current approaches do not appear to be very suitable for expert recommendations in biomedical research. In this study, we present the development and initial evaluation of a vector space model-based algorithm to calculate researcher similarity using four inputs: 1) MeSH terms of publications; 2) MeSH terms and author rank; 3) exploded MeSH terms; and 4) exploded MeSH terms and author rank. We developed and evaluated the algorithm using a data set of 17,525 authors and their 22,542 papers. On average, our algorithms correctly predicted 2.5 of the top 5/10 coauthors of individual scientists. Exploded MeSH and author rank outperformed all other algorithms in accuracy, followed closely by MeSH and author rank. Our results show that the accuracy of MeSH term-based matching can be enhanced with other metadata such as author rank
- …
