Longer, Analytical Posts

Log in

SmokingPipes.com Updates

36 Fresh Rossi Pipes
24 Fresh Johs Pipes
24 Fresh AKB Meerschaum Pipes
2 Fresh Jody Davis Pipes
6 Fresh Estate Pipes

PipesMagazine Approved Sponsor

PipesMagazine Approved Sponsor

PipesMagazine Approved Sponsor

PipesMagazine Approved Sponsor

PipesMagazine Approved Sponsor

Status
Not open for further replies.

sasquatch

Lifer
Jul 16, 2012
1,708
2,999
Cosmic, sorry, I thought I had more or less indicated the answers to your question(s) in the engineering thread.
The goal for the pipe maker is probably two-fold. First we want a pleasant smoking experience - gurgle free and a pipe that tends to smoke to the bottom, this kind of thing. Second, we want the flavor to be excellent - this is sort of obvious, but I can make a pipe utterly gurgle free and also utterly flavorless by filtering EVERYTHING out of the air - smoke, oils, water, tar, all of it! But then we would have a pipe (or rather a contraption) that did not allow us to taste anything at all.
Perhaps both of these points are the same - let me render it another way. A good pipe gets everything from the bowl to the button - it should be delivering the stuff we taste (which are these big floppy molecules, oils and esters mostly) onto our tongue. (This by the way is why if you smoke hot, you taste nothing - you literally burn up the "flavor" into CO2 and H20. If you ask a physical chemist (or even an engineer, but I have B.SC. and not a P.Eng, I hate engineers, they're all into approximations and charts n stuff) how to get all the bits in a hot gas from one place to another and not have them fall out or stick to something (not have them condense), the answer you'll receive is "laminar flow". Laminar as opposed to turbulent. This is a big deal in the giant oil pipelines, for example, where if the flow is in any way conducive to things sticking to the sides, they will, and the flow will get worse, and more stuff will stick to the sides....). We're talking about a gas and not sludgy oil, but the principles are mostly the same, with one major difference - the Joule-Thompson effect is not at play in liquids, can be in gases.
In the Joule-Thompson effect, we see gas pushed through an aperture have a fairly significant temperature drop (which would cause condensation). But to make it significant, you have to have a pretty small aperture and a pretty high pressure. So if you drilled the stem small enough, I guess you could make it even worse for yourself, but it would have to be a pinhole. I DID run these calculations 10 years back.
Back to laminar flow then. We have a fairly hot system (400-600F) but it's not a high pressure one - you are drawing air out of the pipe at just barely any differential over standard pressure (unless you suck VERY hard on your pipe indeed). You can model this (the link is now dead but there was a site where you could just tweak a pipe, a venturi tube essentially, in shape and size and watch the modelling, create eddies etc). But the simply and obvious answer is that you want to make the tube pretty smooth and pretty uniform. A friend of mine, uttering one of the deep truths of pipe smoking, once remarked with casual grace "Oh, if you're interested in seeing where your pipe ISN'T working, simply open it up and clean it - anywhere that you have black deposits is a condensation area." (And it's this kind of empiricism, this kind of experience-tied-to-thought that I'll suggest over-rides calculation here). Understand that we are drilling a hole around 1/8" and we can't make it square, we can't give it rifling, or fins... there's only so much we can control.
A smooth, uniform airway so as not to cause turbulent flow. How big? How shaped?
An airway with an 11/64" bore is capable at any given pressure of carrying almost double the smoke of an airway at 1/8". If you didn't restrict it at the bit, you could measure the Knudsen flow etc but we DO restrict at the bit so there's a bit more complicated of a system - the pressure in the airway in the stummel is higher than the pressure exerted at the stem because the gas is moving faster through the stem than through the airway (Bernoulli). There is no single equation where you can just sit down and plug numbers in and generate something useful here - there's a lot going on - change of shape of the tube, change of temperature of a cooling gas.
So as I said in a previous post in the other thread, one idea is to build a pipe with an airway that is essentially tapered (large at the bowl and small at the button) such that the pressure in the pipe, the interaction of smoke with tube-wall is less as it travels further (and cools off). The other big idea is to just make the thing a constant volume and bring all the smoke at the same speed and just carefully change its shape, as it were, from round to rectangular.
Both work, both work great. As do "reverse" calabashes, as do bongs really.
My answer isn't that I have an equation that tells me how to build pipes. My answer is that principles of engineering (fluid flow modelling, thermodynamics) and physics lead us to try certain ideas out as pipe makers. A real quick modelling problem for example: Assume an imperfect tenon length, ie, a tiny gap. Is the flow better if I bevel the tenon at 45 degrees of if I round off the inside of the tenon? You can look at stuff like this if you have fluid dynamics modelling software handy. Sorry but that's engineering stuff. Do all pipe makers do it (or need to)? Hell no. Because again, we can knock a lot of this stuff together and make it work really well with just a few iterations in the field.
Making great smokers, time in and out, isn't just drilling a couple holes. It really isn't.

 

seacaptain

Lifer
Apr 24, 2015
1,829
10
guy in shed makes a pipe = ???
shed.jpg


 

smokingcricket

Starting to Get Obsessed
May 17, 2018
208
0
Smoke cobs and none of this matters.COBS RULE.I go by the post smokeism rule myself.Anyone wanna buy a vintage Tiberian pipe cleaning chicken?

 

jaytex1969

Lifer
Jun 6, 2017
9,656
52,062
Here
Rooter: A Methodology for the Typical Unification

of Access Points and Redundancy

Jeremy Stribling, Daniel Aguayo and Maxwell Krohn
ABSTRACT

Many physicists would agree that, had it not been for

congestion control, the evaluation of web browsers might never

have occurred. In fact, few hackers worldwide would disagree

with the essential unification of voice-over-IP and public-

private key pair. In order to solve this riddle, we confirm that

SMPs can be made stochastic, cacheable, and interposable.
I. INTRODUCTION

Many scholars would agree that, had it not been for active

networks, the simulation of Lamport clocks might never have

occurred. The notion that end-users synchronize with the

investigation of Markov models is rarely outdated. A theo-

retical grand challenge in theory is the important unification

of virtual machines and real-time theory. To what extent can

web browsers be constructed to achieve this purpose?

Certainly, the usual methods for the emulation of Smalltalk

that paved the way for the investigation of rasterization do

not apply in this area. In the opinions of many, despite the

fact that conventional wisdom states that this grand challenge

is continuously answered by the study of access points, we

believe that a different solution is necessary. It should be

noted that Rooter runs in



(

loglog

n

) time. Certainly, the

shortcoming of this type of solution, however, is that compilers

and superpages are mostly incompatible. Despite the fact that

similar methodologies visualize XML, we surmount this issue

without synthesizing distributed archetypes.

We question the need for digital-to-analog converters. It

should be noted that we allow DHCP to harness homoge-

neous epistemologies without the evaluation of evolutionary

programming [2], [12], [14]. Contrarily, the lookaside buffer

might not be the panacea that end-users expected. However,

this method is never considered confusing. Our approach

turns the knowledge-base communication sledgehammer into

a scalpel.

Our focus in our research is not on whether symmetric

encryption and expert systems are largely incompatible, but

rather on proposing new flexible symmetries (Rooter). Indeed,

active networks and virtual machines have a long history of

collaborating in this manner. The basic tenet of this solution

is the refinement of Scheme. The disadvantage of this type

of approach, however, is that public-private key pair and red-

black trees are rarely incompatible. The usual methods for the

visualization of RPCs do not apply in this area. Therefore, we

see no reason not to use electronic modalities to measure the

improvement of hierarchical databases.

The rest of this paper is organized as follows. For starters,

we motivate the need for fiber-optic cables. We place our

work in context with the prior work in this area. To ad-

dress this obstacle, we disprove that even though the much-

tauted autonomous algorithm for the construction of digital-

to-analog converters by Jones [10] is NP-complete, object-

oriented languages can be made signed, decentralized, and

signed. Along these same lines, to accomplish this mission, we

concentrate our efforts on showing that the famous ubiquitous

algorithm for the exploration of robots by Sato et al. runs in



(

(

n

+log

n

)

) time [22]. In the end, we conclude.
II. ARCHITECTURE

Our research is principled. Consider the early methodology

by Martin and Smith; our model is similar, but will actually

overcome this grand challenge. Despite the fact that such

a claim at first glance seems unexpected, it is buffetted by

previous work in the field. Any significant development of

secure theory will clearly require that the acclaimed real-

time algorithm for the refinement of write-ahead logging by

Edward Feigenbaum et al. [15] is impossible; our application

is no different. This may or may not actually hold in reality.

We consider an application consisting of

n

access points.

Next, the model for our heuristic consists of four independent

components: simulated annealing, active networks, flexible

modalities, and the study of reinforcement learning.

We consider an algorithm consisting of

n

semaphores.

Any unproven synthesis of introspective methodologies will

clearly require that the well-known reliable algorithm for the

investigation of randomized algorithms by Zheng is in Co-NP;

our application is no different. The question is, will Rooter

satisfy all of these assumptions? No.

Reality aside, we would like to deploy a methodology for

how Rooter might behave in theory. Furthermore, consider

the early architecture by Sato; our methodology is similar,

but will actually achieve this goal. despite the results by Ken

Thompson, we can disconfirm that expert systems can be made

amphibious, highly-available, and linear-time. See our prior

technical report [9] for details.

III. I

MPLEMENTATION

Our implementation of our approach is low-energy,

Bayesian, and introspective. Further, the 91 C files contains

about 8969 lines of SmallTalk. Rooter requires root access

in order to locate mobile communication. Despite the fact

that we have not yet optimized for complexity, this should be

simple once we finish designing the server daemon. Overall,

DNS

server

VPN

Client

A

NAT

Remote

server

Remote

firewall

Home

user

Bad

node

Server

A

Fig. 1.

The relationship between our system and public-private key

pair [18].

Rooter

Emulator

Shell

Simulator

Kernel

Keyboard

Editor

Fig. 2.

The schematic used by our methodology.

our algorithm adds only modest overhead and complexity to

existing adaptive frameworks.

IV. R

ESULTS

Our evaluation method represents a valuable research contri-

bution in and of itself. Our overall evaluation seeks to prove

three hypotheses: (1) that we can do a whole lot to adjust

a framework’s seek time; (2) that von Neumann machines

no longer affect performance; and finally (3) that the IBM

PC Junior of yesteryear actually exhibits better energy than

today’s hardware. We hope that this section sheds light on

Juris Hartmanis ’s development of the UNIVAC computer in

1995.

2

4

2

4

8

16

32

64

128

work factor (# CPUs)

time since 1977 (teraflops)

Fig. 3.

The 10th-percentile seek time of our methodology, compared

with the other systems.

-20

0

20

40

60

80

100

-10

0

10

20

30

40

50

60

70

80

90

time since 1993 (man-hours)

sampling rate (MB/s)

topologically efficient algorithms

2-node

Fig. 4.

These results were obtained by Dana S. Scott [16]; we

reproduce them here for clarity.

A. Hardware and Software Configuration

One must understand our network configuration to grasp

the genesis of our results. We ran a deployment on the NSA’s

planetary-scale overlay network to disprove the mutually large-

scale behavior of exhaustive archetypes. First, we halved the

effective optical drive space of our mobile telephones to

better understand the median latency of our desktop machines.

This step flies in the face of conventional wisdom, but is

instrumental to our results. We halved the signal-to-noise ratio

of our mobile telephones. We tripled the tape drive speed of

DARPA’s 1000-node testbed. Further, we tripled the RAM

space of our embedded testbed to prove the collectively secure

behavior of lazily saturated, topologically noisy modalities.

Similarly, we doubled the optical drive speed of our scalable

cluster. Lastly, Japanese experts halved the effective hard disk

throughput of Intel’s mobile telephones.

Building a sufficient software environment took time, but

was well worth it in the end.. We implemented our scat-

ter/gather I/O server in Simula-67, augmented with oportunis-

tically pipelined extensions. Our experiments soon proved that

automating our parallel 5.25” floppy drives was more effective

than autogenerating them, as previous work suggested. Simi-
http://news.mit.edu/2015/how-three-mit-students-fooled-scientific-journals-0414
jay-roger.jpg


 
Status
Not open for further replies.