., full diagnosis (detection and location) is
 accomplished. Initially, a simple coloring approach
 based on a greedy condition of the adjacency graph is
 proposed for fault detection. Then, the conditions for
 aliasing and confounding are analyzed with respect to
 the sizes of the possible shorts. These results are
 used to generate new colors using a process called
 color mixing. Color mixing guarantees that additional
 tests, required in order to avoid aliasing/confounding,
 will use appropriate codes. The characteristics of
 unbalanced/balanced codes for encoding the colors in
 the vector-generation process of interconnect diagnosis
 are discussed and are proved to yield full diagnosis
 using a novel method. An algorithm for full diagnosis
 is then presented; this algorithm has an execution
 complexity of $O(\max(N^2, N \times D^3))$ where $N$ is
 the number of nets and $D$ is the maximum degree of the
 nodes in the adjacency graph. Simulation results show
 that the proposed approach requires a smaller number of
 test vectors than previous approaches.",
 acknowledgement = ack-nhfb,
 journal-URL = "_URL_
 keywords = "balanced code; diagnosis; graph coloring;
 interconnect; syndrome",
 subject = "Mathematics of Computing --- Discrete Mathematics ---
 Graph Theory (G.2.2); Computer Applications ---
 Computer-Aided Engineering (J.6); Hardware ---
 Performance and Reliability --- Reliability, Testing,
 and Fault-Tolerance (B.8.1)",
}
@Article{Mehta:1998:ESR,
 author = "Dinesh P. Mehta",
 title = "Estimating the storage requirements of the rectangular
 and {L-shaped} corner stitching data structures",
 journal = j-TODAES,
 volume = "3",
 number = "2",
 pages = "272--284",
 month = apr,
 year = "1998",
 CODEN = "ATASFO",
 ISSN = "_PHONE_ (print), _PHONE_ (electronic)",
 bibdate = "Fri Jul 27 10:05:33 MDT 2001",
 bibsource = "_URL_
 _URL_
 URL = "_URL_
 _URL_
 abstract = "This paper proposes a technique for estimating the
 storage requirements of the Rectangular Corner
 Stitching (RCS) data structure [Ousterhout 1984] and
 the L-shaped Corner Stitching (LCS) data structure
 [Mehta and Blust 1997] on a given circuit by studying
 its (the circuit's) geometric properties. This provides
 a method for estimating the storage requirements of a
 circuit without having to implement the corner
 stitching data structure, which is a tedious and
 time-consuming task. This technique can also be used to
 estimate the amount of space saved by employing the LCS
 data structure over the RCS data structure on a given
 circuit.",
 acknowledgement = ack-nhfb,
 generalterms = "Algorithms",
 journal-URL = "_URL_
 keywords = "corner stitching; data structures; L-shapes; memory
 requirements analysis; rectangle; rectilinear
 polygons",
 subject = "Hardware --- Integrated Circuits --- Design Aids
 (B.7.2): {\bf Layout}; Data --- Data Storage
 Representations (E.2): {\bf Linked representations};
 Theory of Computation --- Analysis of Algorithms and
 Problem Complexity --- Nonnumerical Algorithms and
 Problems (F.2.2): {\bf Geometrical problems and
 computations}",
}
@Article{Bhattacharya:1998:ERS,
 author = "Subhrajit Bhattacharya and Sujit Dey and Franc
 Breglez",
 title = "Effects of resource sharing on circuit delay: an
 assignment algorithm for clock period optimization",
 journal = j-TODAES,
 volume = "3",
 number = "2",
 pages = "285--307",
 month = apr,
 year = "1998",
 CODEN = "ATASFO",
 ISSN = "_PHONE_ (print), _PHONE_ (electronic)",
 bibdate = "Fri Jul 27 10:05:33 MDT 2001",
 bibsource = "_URL_
 _URL_
 URL = "_URL_
 _URL_
 abstract = "This paper analyzes the effect of resource sharing and
 assignment on the clock period of the synthesized
 circuit. The assignment phase assigns or binds
 operations of the scheduled behavioral description to a
 set of allocated resources. We focus on control-flow
 intensive descriptions, characterized by the presence
 of mutually exclusive paths due to the presence of
 nested conditional branches and loops. \par
 We show that clustering multiple operations in the same
 state of the schedule, possibly leading to chaining of
 functional units (FUs) in the RTL circuit, is an
 effective way to minimize the total number of clock
 cycles, and hence total execution time. We present an
 assignment algorithm that is particularly effective for
 such design styles by minimizing data chaining and
 hence the clock period of the circuit, thereby leading
 to further reduction in total execution time.
 \par
 Existing resource sharing and assignment approaches for
 reducing the clock period of the resulting circuit
 either increase the resource allocation or use faster
 modules, both leading to leading to larger area
 requirements. In this paper we show that even when the
 type of available resource units and the number of
 resource units of each type is fixed, different
 assignments may lead to circuits with significant
 differences in clock period. \par
 We provide a comprehensive analysis of how resource
 sharing and assignment introduces long paths in the
 circuit. Based on the analysis, we develop an
 assignment algorithm that uses a high-level delay
 estimator to assign operations to a fixed set of
 available resources so as to minimize the clock period
 of the resultant circuit, with no or minimal effect on
 the area of the circuit. Experimental results on
 several conditional-intensive designs demonstrate the
 effectiveness of the assignment algorithm.",
 acknowledgement = ack-nhfb,
 journal-URL = "_URL_
 keywords = "clock period; high-level synthesis; resource sharing",
 subject = "Hardware --- Register-Transfer-Level Implementation
 --- Design Aids (B.5.2): {\bf Optimization}",
}
@Article{Cabodi:1998:AVB,
 author = "Gianpiero Cabodi and Paolo Camurati and Stefano Quer",
 title = "Auxiliary variables for {BDD-based} representation and
 manipulation of {Boolean} functions",
 journal = j-TODAES,
 volume = "3",
 number = "3",
 pages = "309--340",
 month = jul,
 year = "1998",
 CODEN = "ATASFO",
 ISSN = "_PHONE_ (print), _PHONE_ (electronic)",
 bibdate = "Fri Jul 27 10:05:33 MDT 2001",
 bibsource = "_URL_
 _URL_
 URL = "_URL_
 _URL_
 abstract = "BDDs are the state-of-the-art technique for
 representing and manipulating Boolean functions. Their
 introduction caused a major leap forward in synthesis,
 verification, and testing. However, they are often
 unmanageable because of the large amount of nodes. To
 attack this problem, we insert auxiliary variables that
 decompose monolithic BDDs in smaller ones. This method
 works very well for Boolean function representation. As
 far as combinational circuits are concerned,
 representing their functions is the main issue. Going
 into the sequential domain, we focus on traversal
 techniques. We show that, once we have Boolean
 functions in decomposed form, symbolic manipulations
 are viable and efficient. We investigate the relation
 between auxiliary variables and static and dynamic
 ordering strategies. Experimental evidence shows that
 we achieve a certain degree of independence from
 variable ordering. Thus, this approach can be an
 alternative to dynamic re-ordering. Experimental
 results on Boolean function representation, and exact
 and approximate forward symbolic traversal of FSMs,
 demonstrate the benefits both in terms of memory
 requirements and of CPU time.",
 acknowledgement = ack-nhfb,
 generalterms = "Design; Verification",
 journal-URL = "_URL_
 keywords = "binary decision diagrams; finite state machines;
 functional decompositions; reachability analysis",
 subject = "Hardware --- Logic Design --- Design Aids (B.6.3):
 {\bf Verification}",
}
@Article{Cong:1998:BSC,
 author = "Jason Cong and Andrew B. Kahng and Cheng-Kok Koh and
 C.-W. Albert Tsao",
 title = "Bounded-skew clock and {Steiner} routing",
 journal = j-TODAES,
 volume = "3",
 number = "3",
 pages = "341--388",
 month = jul,
 year = "1998",
 CODEN = "ATASFO",
 ISSN = "_PHONE_ (print), _PHONE_ (electronic)",
 bibdate = "Fri Jul 27 10:05:33 MDT 2001",
 bibsource = "_URL_
 _URL_
 URL = "_URL_
 _URL_
 abstract = "We study the minimum-cost bounded-skew routing tree
 problem under the pathlength (linear


text:
Lab-scale experiments were conducted to identify the flow phenomena of water flushed from a low horizontal section into an upward inclined section of a 50 mm tube by oil flow. The process of water displacement by the oil was also simulated by using the volume of fluid (VOF) model implemented in FLUENT. The simulations were found to be in good agreement with the experimental results. The simulation results substantiate the applicability of a simple mechanistic model, which is based on water 'plug formation' for predicting the critical conditions for the onset of water displacement. A parametric study on the effects of the water volume, oil velocity, pipe diameter, inclination angle, physical properties on the simulation results was also carried out.
All Science Journal Classification (ASJC) codes
- !!Fuel Technology
- !!Geotechnical Engineering and Engineering Geology

source: m-a-p/FineFineWeb


This project was entered in the LSAA 2011 Design Awards (Cat 1, 1968)
Inverted conic covering a communal deck for year 5 & 6 girls at Melbourne Girls Grammar
The structural form is an asymmetric inverted conic, with what is basically a rectangular upper perimeter. In plan the area covered is small, about 12.5m by 11m, and the height varies from 3m at the bale ring to 5.5m at the lower edge to 9m at the highest edge
The conical form is asymmetrical about all axes. The bale ring has been set close to one corner so that the inverted conical shape is accentuated by being well away from the adjoining buildings to which it is attached, and so that the stormwater drainage through the bale ring has minimal interference with use of the deck on wet days.
The function of the structure is to provide critical protection of the school students from the elements during breaks in their school day, creating an outdoor leisure environment that mixes native plants with modern aesthetic material technology. It provides a space where the children can relax and briefly escape the physical confines of school. Even whilst raining, the children can retreat to this area and have their senses stimulated by the rain drumming on the tensioned fabric whilst the water is collected and pushed along the highly strung cables, creating a cylinder of rushing water. Classes can be held on the tiered decking during most weather conditions.
The inverted conic shape is attached to buildings on the south and west sides, and rises high to open edges on the east and north sides. The shape has been designed to allow morning light to penetrate all year around, whilst the northern sun penetration is tailored to the seasons. In winter, the low sun penetrates and warms all areas of the deck, even though it it is still protected from rain and prevailing southerly and westerly winds. In summer the deck is protected from the high sun by the outer edges, and kept protected from hot afternoon sun by the adjoining buildings.
This structure and its environment was designed and constructed during one of the most devastating droughts Victoria was endured, where water and its conservation is paramount. In this project, the water is gathered in this giant funnel and collected in the enormous water tanks deep beneath the landscaped gardens. This water is then used to irrigate the plants, ensuring their survival even when water restrictions prevent use of mains water.
The architects had conceived the deck as a communal space and wanted to provide shelter to it without it feeling enclosed. A new building of significant height was being constructed on the south side, and an existing 4-storey building was located on the western side.
The entrant worked with the architects right from the conceptual stage, and soon developed the inverted conic form. Other constraints and requirements were then considered in developing the detail, including
- weather protected path of travel from the south,
- a sense of separation from the older building to the west
- minimization of supports through the deck and in the gardens, and location of these supports away from play spaces and paths of travel
- protection from rain
- sunlight penetration summer and winter
- inspiring shape and form appropriate to a venue for inquiring minds keen to learn and discover
The structural expression minimizes the appearance of supports by attaching the high southern edge into the facade of the new building, with the fixing beam incorporated into a pattern of screens which stand off the facade to provide shading and visual screening.
The north edge is attached to a circular hollow section on two struts which lean away from the structure and have a single cable guy for each strut, providing a clear visual statement as to the development of tension in the fabric surface. Lateral restraint is provided by a single attachment of one end of the CHS to the existing building. The struts and guys are set partway along the CHS to emphasis the floating cantilever at the outer end and to balance out structural actions on this member. Although the strut bases are designed as fixed, overhead safety cables are provided in inconspicuous locations to ensure stability of steel elements in the event of loss of fabric tension.
Catenary edge cables are provided on the east and west sides to ensure visual lightness of the structure is maintained.
Post bases and tie-downs are connected to bored piers drilled into the mudstone, so the expression of foundations is minimal. The bale ring tiedown uses eight stainless steel cables to form a hyperbolic paraboloid shape which also directs rainwater runoff into a collection pit.
The membrane geometry was quite difficult to achieve because of the high degree of offset of the conic. At first pass the contractor advised they could not pattern the required shape without using over-fabric cables. These introduced folds into the fabric shape which the architect did not want, so the entrant worked closely with the specialist analysis engineers to demonstrate the stress fields and patterning which allowed the design shape to be developed with fabric only, providing the smoothly contoured conic shape which was eventually constructed.
A fabric pre-tension of nominally 1.5 kN/m in warp and weft directions was used as the basis for the fabric tension, with higher stresses obviously being developed in the narrow conic area.
Other design loads included roof live load of 0.25 kPa and wind loads to AS 1170.2
Cost and durability were both important, so a PVDF/PVC coated polyester fabric was used, with galvanized cables for the guys and edge cables, and stainless steel for the elements closer to the users such as the bail ring tie-down cables. The main steel elements were coated with a high performance paint system (blast clean, inorganic zinc primer, and epoxy top coats) to provide in excess of 30 years durability in this environment.
The fabric used was Ferrari 1002 Fluotop T, from France, and all elements including fabric, structural steel and cables were fabricated in Australia.
A detailed site survey was carried out to confirm geometry of all connection points including set out and as-constructed positions for footings.
Shop details for steelwork were prepared and reviewed by the design engineer, and fabric patterns were prepared and reviewed by the design engineers. The details were developed to provide as much tolerance as possible, with adjustment available in all fabric connections.
Membrane fabrication used overlap seams and high frequency welding. Fabric tolerances were to within 5mm.
Steel fabrication was by conventional methods, and steelwork fabrication tolerances were 2mm.
The design was a collaborative effort between the designer/engineer and the architect for the early stages when the concept was developed, then required more detailed collaboration between the designer/engineer, the specialist engineer, and the contractor to ensure the vision of the original concept was delivered without compromise.
Construction was reasonably simple, with main steel supports at each end being installed, fabric being attached to those, then final tensioning being done by catenary cables and the conic tie-down cables.
Little maintenance will be required as steel and cable components are designed for long life with no attention other than periodic inspection.
The fabric will need to be cleaned, and access for this is easily obtained by boom lift or cherry picker. Frequency of cleaning will depend on how much soiling occurs, but the area is not heavily industrialized and annual cleaning is expected to suffice.
Project Number: 1968
Title: Melbourne Girls Grammar School Cover to Communal Deck
Location: 86 Anderson St, South Yarra, Vic 3141
Entrant: SEMF Pty Ltd
Role: Designer & Engineer
Client: Melbourne Girls Grammar School
Architect: Sally Draper & Associates
Structural Engineer: SEMF
Spec Consultant: Wade Design Engineers
Builder: Oasis tension Structures
Fabricator: Oasis Tension Structures
Steelwork etc:


text:
Leadership Opportunities at Reed
There are many ways for students to pursue leadership opportunities at Reed. Research with faculty, student employment, and community engagement are some of the ways to get involved. We've chosen to highlight the following leadership opportunities within student services departments and through participation in student governance.
- Peer Tutors: One-on-one tutoring is provided by qualified Reed students of advanced standing and is available for most classes.
- Night Owls: Students focus on harm reduction during social events.
- Peer Health Advocates: Students serve as peer role models and support the health and wellness program.
- Sexual Assault Prevention and Response Interns: Students focus on effective consent education.
- InterConnect Program: The InterConnect program seeks to support new international students in their cultural, social, and academic transition to Reed by matching them with a current Reedie.
- Peer Mentor Program: The Peer Mentor Program (PMP) assists first-year and transfer students from underrepresented communities with their college transition by pairing them with a returning student mentor.
- Orientation Week Outdoor Trips: Every August, Reed offers fantastic opportunities to explore the Pacific Northwest via foot, boat, body, and mind through recreational odysseys for incoming students.
- Reed Outing Club: The Reed Outing Club, restarted in 1998 after a long hiatus, assists the Reed community in planning events and trips in the Northwest.
- House Advisors: Students are selected for their skills and interest in helping fellow students and are trained in areas such as peer counseling and conflict mediation.
- Reed offers nine varsity club sports: rugby, soccer, Ultimate Frisbee, basketball, squash, rowing and curling.
- Student Interns and Coordinators: SEEDS brings together students, faculty, staff, and alumni who support community efforts to bring about social change.
- Academic Teams: Students participate in chess, debate, mock trial, and model U.N.
- Conferences: Each summer, Reed sends students to the Leadershape Institute. The college pays all costs associated with this exciting opportunity.
- Consultations: Students can visit the student activities office to see the many types of support available for student groups to be successful in achieving their goals. Groups can discuss topics like establishing a mission, clarifying vision and values, conflict resolution, and maintaining institutional memory.
- Drop-In Sessions: Drop-in, interactive sessions are available throughout the year for students to spend an hour or so learning about a specific issue. No need to RSVP, and snacks are provided.
- Leadership Retreat: Each fall, an overnight retreat allows students to explore a leadership topic more thoroughly. The Leadership Retreat takes place at beautiful Camp Magruder on the Oregon Coast.
- Student Organizations: Reed College student organizations represent a wide variety of interests, ideologies, spiritual practices, cultures, and activities.
- Reed Leadership Academy (RELAY): The mission of RELAY is to support Reed's core academic mission by promoting responsible action, pluralistic thought, and the development of lifelong, practical interpersonal skills. Students engage in experiential learning, personal reflection, and advising relationships.
Honor Council: The Honor Council (HC) is a committee of students, faculty, and staff dedicated to promoting the Honor Principle in the Reed community. Members are organized into subcommittees around the goals of education, mediation, and advocacy for community rights.
Judicial Board: The Reed College Student Judicial Board (J-Board) serves a vital role in a community governed by an Honor Principle. If community members are unable to work out an alleged Honor Principle violation, the J-Board provides formal adjudication.
Student Senate: The student senate plays an influential role on Reed's campus. Senate is the voice of the students: its members fund student organizations, participate in campus policy-making, and work with staff members to improve the quality of student life.
Questions about leadership opportunities? Please e-mail _EMAIL_.

source: openbmb/Ultra-FineWeb


text:
Tamarind (Tamarindus indica L.) is a fruit species native to Equatorial Africa, India and Southeast Asia. Its seeds experience slow germination, thus, study on the influence of environmental factors, such as water and salt stresses, on seed germination, is required to assess the tolerance of these seeds to storage, and to maintain the vigor and the viability in the period between harvesting and sowing. The objective of this study was to evaluate the performance of tamarind seeds subjected to salt and water stresses and to storage. Three experiments were carried out in a completely randomized design with four replications of 25 seeds, totaling 100 seeds per treatment. For stress conditions, treatments consisted of moistening of the substrate with different concentrations of PEG 6000 (experiment 1) and NaCl (experiment 2) - 0 (control); -0.3; -0.6; -1.2. For the storage trial (experiment 3), seeds remained stored for 0 (control), 12, 24, 36 and 48 months. In the germination test, the percentage of germination, the speed of germination index, the mean speed and the mean germination time were assessed. All variables were influenced by the water and salt stress, and the seeds of tamarind sensitive to potential used in this work. As in the test with water and saline potential storage trials showed that the physiological seed quality was impaired when they were subjected to long storage period.
Key words: Tamarindus indica L, salinity, polyethyleneglycol, stress, storage.
Copyright © 2023 Author(s) retain the copyright of this article.
This article is published under the terms of the Creative Commons Attribution License 4.0


text:
The digging is done on Monroe County's $5 million effort to restore five troubled canal systems but the watching goes on.
The installation of a weed-gate curtain in Big Pine Key's Atlantic Estates subdivision marked the end of the construction phase on six prototype projects that test varied techniques in a quest to cure sick canals.
For the next two years, Florida International University experts will compare changes in water quality against water samples taken before construction work began in early 2015.
"The initial post-construction monitoring results are promising," said Rhonda Haag. "They show improved dissolved-oxygen levels and [water] clarity.... We are pleased that the early results show the restored canals are helping to bring back marine life."
Haag, who oversees the pilot program as Monroe County's sustainability director, said, "We already have learned much from each type of project."
The first slate of projects test restoration methods that could be used for future projects if funding is available. Some prototype canal projects have already revealed needed changes in planning and technology.
Poorly planned canal systems dug decades ago can create environmental conditions that degrade water quality. That unhealthy water then flows into nearshore Keys waters.
"The threat is real to our nearshore waters, the same waters that drive our tourist-based economy," County Commissioner George Neugent said in a prepared statement.
Status of the first six canal projects:
- Canal No. 29, in Key Largo's Sexton Cove subdivision. Engineering and construction costs of $1.36 million backfilled a deep canal, about 225 yards long, to depths of 8 feet. The project's four-month construction finished in July 2015. Water clarity has improved, healthy plants sprouted and "a return of abundant sea life was noted by canal residents."
- Canal Nos. 470 and 472 on Geiger Key were connected by a 112-foot culvert, 24 inches by 38 inches, to improve flushing. It worked after its April 2015 opening, but a seaweed buildup in the pipe caused it to be closed in July 2015. After changes were made, the culvert was reopened last month. Cost was $221,000, of which the state funded $100,000.
- Canal No. 266 in Big Pine Key's Doctor's Arm subdivision, described as "one of the very worst in the entire county" due to muck and decayed seaweed. The $1.35 million project finished last month after extensive vacuum dredging and air-curtain installation.
- Canal No. 290 off Avenue I on Big Pine saw similar vacuum dredging to remove muck five feet deep from the bottom at a $798,000 cost. A pre-existing weed gate needs replacing or upgrades since it did not block some seaweed from returning
- Canal No. 277 in Tropical Bay Estates on Big Pine Key got a 200-foot culvert, 60 inches in diameter, to improve tidal flushing at a cost of $424,000.
- Canal 287 on Big Pine Key received a $150,000 air curtain to block seaweed.
Two more canal projects, funded by an additional $2 million, are planned for this year.


text:
Type of Document Dissertation Author Ning, Puqi URN etd-05172010-170211 Title Design and Development of High Density High Temperature Power Module with Cooling System Degree PhD Department Electrical and Computer Engineering Advisory Committee
Advisor Name Title Ngo, Khai D. T. Committee Co-Chair Wang, Fei Fred Committee Co-Chair Boroyevich, Dushan Committee Member Centeno, Virgilio A. Committee Member Lin, Tao Committee Member Keywords
- SiC devices
- high temperature
- high power density
- planar package
- wirebond package
Date of Defense 2010-05-04 Availability unrestricted AbstractIn recent years, the SiC power semiconductor has emerged as an attractive alternative that pushes the limitations of junction temperature, power rating, and switching frequency of Si devices. These advanced properties will lead converters to higher power density. However, the reliability of the SiC semiconductor is still under investigation, and at the same time, the standard Si device packages do not meet the requirement of high temperature operation. In order to take full advantage of SiC semiconductor devices, high density, high temperature device packaging needs to be developed.
In this dissertation, a high temperature wirebond package for multi-chip phase-leg power module using SiC devices was designed, developed, fabricated and tested. The details of the material selection and thermo-mechanical reliability evaluation are described. High temperature power test shows that the presented package can perform well at the high junction temperature.
In order to increase the power density, reduce the parasitic parameters, and enhance the electrical, thermo-mechanical performance over wirebond packages, planar package is utilized to better take advantages of SiC device. This dissertation proposed a novel package, in which the interconnections can be formed on small dimensional pads and enclosed pads that may baffle the regular solder based connection in other planar packages. Electrical and thermo-mechanical tests of the prototype module demonstrate the functionality and reliability of the presented planar packaging methodology.
In this dissertation, together with the design example, the manual module layout design and automatic module layout design process are also presented. Furthermore, a systematic optimal design process and parametric study of the heatsink-fan cooling system by applying the analytical model is described. This dissertation also established a systematic testing procedure which can rapidly detect defects and reduce the risk in high temperature packaging testing. Finally, a wirebond module and a planar module are designed for 175 ºC junction temperature and 250 ºC junction temperatures. All the key concepts and ideas developed in this work are implemented in the prototype module development and then verified by the experimental results.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access Ning_P_D_2010.pdf 2.76 Mb 00:12:45 00:06:33 00:05:44 00:02:52 00:00:14
If you have questions or technical problems, please Contact DLA.


Quick Answer: How Does Wax Recording Work?
Does black vinyl sound better?
Only white should sound worse.
The white substance used to due the record can cause random pops (rumor has it that it is a kind of chalk).
Other vinyl – colored or clear can be dead-quiet.
so a colored vinyl record with no black in it may actually sound better right out of the wrapper than a black one..
What is a wax record?
The wax record simply put is a hollow cylinder made from wax that, when put into a phonograph or graphophone machine it allows you to record sound and reproduce that same sound.
Why is vinyl called wax?
This was electroplated to make the metal parts to stamp finished records. Hence, for almost the first 50 years of recorded sound, including cylinders, wax was the media that took the original sound waves. Therefore the term "wax" came into popular use as slang for a record.
Is Vinyl A plastic?
Vinyl (polyvinyl chloride or PVC), is the world's most versatile plastic, used to make everything from food wrap to auto body parts. Vinyl is composed of two simple building blocks: chlorine, based on common salt, and ethylene, from crude oil.
Is a record player worth it?
It's mainly worth it if you're going to listen to stuff on vinyl. There's no point in making the investment if it's going to sit and collect dust. If you feel drawn to vinyl, then absolutely. It's mainly worth it if you're going to listen to stuff on vinyl.
When were wax cylinders used?
The Edison Phonograph Company was formed on October 8, 1887, to market Edison's machine. He introduced the Improved Phonograph by May of 1888, shortly followed by the Perfected Phonograph. The first wax cylinders Edison used were white and made of ceresin, beeswax, and stearic wax.
What were records originally made of?
Why is vinyl used for records?
Why is it that vinyl records are generally black? PVC (polyvinyl chloride), the material that vinyl records are made of, is clear in its natural form, allowing records to be manufactured in just about any color imaginable.
Does vinyl actually sound better?
Vinyl is far more high-quality. No audio data is lost when pressing a record. It sounds just as great as the producer or band intended. There's another, far superior reason why vinyl is better than lossy digital formats.
Is my record a 33 or 45?
12″ records that are albums (>20 minutes per side) are 33, 12″ records that are singles may be 33 if they are from the US or 45 if they are from Europe. 10″ records are usually 33, but there may be 45 as well.
How long does a gramophone needle last?
Most manufacturers recommend changing your stylus at around 1000 hours of record playing time. So if you're using your turntable for an hour or so per day on average, ideally you should be changing the stylus every couple of years.
How do gramophones work?
Like other record players, gramophones read the sound with a small needle which fits into the groove in the record. That needle is attached to a diaphragm, which in turn is attached to a horn. … These vibrations are transmitted to the diaphragm, which itself vibrates, creating sound.
Are 78s worth anything?
"The early blues material from the '20s and '30s is the hottest material of all," Mr. Tefteller said in a phone interview. He said that on average a rare jazz 78 might sell for $1,500 to $5,000, whereas sales for a comparable blues record would start at $5,000.
What was the first song ever recorded on the phonograph?
Au Clair de la Lune.On April 9, 1860, Scott recorded a snippet of the French folk song "Au Clair de la Lune."
Who invented wax cylinders?
Thomas EdisonPhonograph cylinder/InventorsEdison had introduced wax cylinders that played for nominally 4 minutes (instead of the usual 2) in 1909 under the Amberol brand. They were made from a harder (and more easily breakable) form of wax to withstand the smaller stylus used to play them.
What is the best record player to buy?
The best record player for 2021CNET's Editor's Choice. Fluance RT82. See at Amazon.Best value around $100. Audio Technica AT-LP60X. $119 at Amazon.Best record player under $500. Pro-Ject Debut Carbon EVO. $499 at Audio Advice.Best record player under $1,000. Rega Planar 3. $945 at Audio Advice.Best mainstream model under $300. Crosley C10A. See at Amazon.Feb 8, 2021
Why is tinfoil a poor medium for recorded sound?
The recordings could be played only a few times before the indentations made by the sound on the tinfoil were so flattened down as to be unplayable. … It was changes in the physical medium itself that would ultimately exert the most long-lasting effects on the evolution of American sound recording history.
How does a vinyl record work?
Vinyl record players are electromagnetic devices that change sound vibrations into electrical signals. When a record spins, it creates sound vibrations that get converted into electrical signals. … Electric amps vibrate and feed the resulting sound into speakers, which amplify it and make it louder.
What is another name for vinyl?
What is another word for vinyl?PVCpolychloroethylenepolyvinyl chloridepolyvinylpoly(1-chloroethene)[1]
What's the difference between a turntable and a record player?
What Is A Turntable? In its basest form, a turntable is simply a major component of a record player. … But turntable also refers to a standalone unit you can purchase. In this sense of the word, a turntable is similar to a record player, except it does not come with built-in speakers or an amplifier.
What replaced records?
In an attempt to head off the disc advantage, Edison introduced the Amberol cylinder in 1909, with a maximum playing time of 4 1⁄2 minutes (at 160 rpm), which in turn were superseded by Blue Amberol Records, which had a playing surface made of celluloid, a plastic, which was far less fragile.


text:
Using Prop Key Editor
In addition to applying Elastic Motion Templates, you are allowed to create custom elastic motions with Cartoon Animator.
( Watch Tutorial - Creating Custom Elastic Motions )
Create a prop ( in this case, it is a compound prop with fish bowl and water).
This prop is deliberately designed for this section. It has two components and it was composed inside the Composer mode.
- Go to a time frame.
- Move the prop. This will transform the entire composed prop.
- Go to another time frame and move the prop again.
The prop now has a transform animation. The keys are set to the Transform track of the prop.
- Go to the time frame when the animation starts.
- Click the Prop Key Editor button on the Toolbar.
You will see the Prop Key Editor display on the screen.
- Press down the Transform button to enter the transforming mode.
- Select the component of the prop and transform it (in this case, the water).
- .Press down the Deform button to enter the deforming mode.
- Deform the component by dragging the 9 control points of the deforming box.
In order to see the Deform effect working on another prop, you must select the prop, open the Prop Key Editor, switch to the Deform mode and activate the Smooth Deformed Object box in order to subdivide the prop.
Smooth Deformed Object is OFF
Smooth Deformed Object is ON
- Optionally adjust the Opacity value of the component.
- Go to the other time frame and adjust the Transform, Deform and Opacity in the same manner.
- The keys are set to the sprite-level tracks (*_T, *_S, *_D, *_O).
- Add more keys in order to fine-tune the animation of the sprite component.
- Play back to view the animation. Fine-tune with the Prop Key Editor if necessary.


text:
Biped robot walking control on inclined planes with fuzzy parameter adaptation
Yılmaz, Metin and Seven, Utku and Erbatur, Kemalettin (2010) Biped robot walking control on inclined planes with fuzzy parameter adaptation. In: IFAC Workshop Adaptation and Learning in Control and Signal Processing (ALCOSP 2010), Antalya, Turkey
The bipedal structure is suitable for a robot functioning in the human environment, and assuming assistive roles. However, the bipedal walk is a poses a difficult control problem. Walking on even floor is not satisfactory for the applicability of a humanoid robot. This paper presents a study on bipedal walk on inclined planes. A Zero Moment Point (ZMP) based reference generation technique is employed. The orientation of the upper body is adjusted online by a fuzzy logic system to adapt to different walking surface slopes. This system uses a sampling time larger than the one of the joint space position controllers. A newly defined measure of the oscillatory behavior of the body pitch angle and the average value of the pelvis pitch angle are used as inputs to the fuzzy adaptation system. A 12-degrees-of-freedom (DOF) biped robot model is used in the full-dynamics 3-D simulations. Simulations are carried out on even floor and inclined planes with different slopes. The results indicate that the fuzzy adaptation algorithms presented are successful in enabling the robot to climb slopes of 5.6 degrees (10 percent).
Repository Staff Only: item control page


text:
Earthquake Glossary - turbidites
Turbidites are sea-bottom deposits formed by massive slope failures where rivers have deposited large deltas. These slopes fail in response to earthquake shaking or excessive sedimentation load. The temporal correlation of turbidite occurrence for some deltas of the Pacific Northwest suggests that these deposits have been formed by earthquakes.
Turbidites (interbedded with mudstones/siltstones) from the Ross Sandstone Formation Turbidite system of Namurian age in County Clare, Western Ireland. The sandstone beds were formed in a deep basin by turbidites coming from a delta area.

source: HuggingFaceFW/fineweb-edu


text:
ADT at Gartner ITxpo: Gartner on RFID
The sensor network, already emerging from applications of RFID chips, will transform computing and life as we know it by 2014, predicts Gartner fellow Tom Austin.
Holding up a vial containing tiny RFID chips, Austin told attendees at Gartner Symposium/ITxpo 2004 in San Diego that the chips will impact every industry -- going far beyond their current role in Wal-Mart's supply-chain management experiments.
While some consumer advocates express concern about the privacy dangers inherent in putting silicon bar codes in every piece of merchandise bought, Austin foresees healthcare applications where RFID "may save your life."
He imagines a future scenario where an unconscious patient is wheeled into an emergency room and the doctors and nurses instantly know all current medications and drug allergies from information supplied by the patient's RFID tag.
Coupled with ultra wide-band and WiMAX, RFID chips will be able -- in the next decade -- to broadcast megabits of data over a 30-mile radius, thus connecting RFID chips to the Internet, Austin said. This will allow for agri-business applications, such as vineyards where every vine is monitored for irrigation and climate conditions, so grape growing can be micro-managed via a computer network, he explained.
Simultaneous to the evolution of RFID chips will be the development of Tera Architecture, which will allow for the real-time processing of terabytes of data, he predicted. This event-driven architecture will make it possible for applications to organize and make sense of the huge amounts of real-time data that RFID monitors will produce, Austin said.
Rich Seeley is Web Editor for Campus Technology.


text:
BEIA participated on the 30th of April at ELSE2020 called "eLearning and software for education", with the paper "An Introduction to Ubiquitous Computing in the Military Network". ELSE2020 is an international scientific conference that facilitates corporate and research entities to advance the potential of the technologically augmented learning environments, by offering a symposium for exchange of research outcomes, various ideas, technical achievements and business cases. Hence, the SealedGRID's results and future scientific goals through the paper were communicated to the audience.
- EAB Cyber Meeting
- New Cyberwatching Newsletter is out!!


text:
Transport - Template
The illustration template "Transport" contains vector clipart of transportation vehicles, office buildings and ancillary facilities.
"Transport or transportation is the movement of people, animals and goods from one location to another. Modes of transport include air, rail, road, water, cable, pipeline and space. The field can be divided into infrastructure, vehicles and operations. Transport is important because it enables trade between people, which is essential for the development of civilizations. Transport infrastructure consists of the fixed installations including roads, railways, airways, waterways, canals and pipelines and terminals such as airports, railway stations, bus stations, warehouses, trucking terminals, refueling depots (including fueling docks and fuel stations) and seaports. Terminals may be used both for interchange of passengers and cargo and for maintenance. Vehicles traveling on these networks may include automobiles, bicycles, buses, trains, trucks, people, helicopters and aircraft." [Transport. Wikipedia]
The illustration template "Transport" for the ConceptDraw PRO diagramming and vector drawing software is included in the Aerospace and Transport solution from the Illustration area of ConceptDraw Solution Park.


Nanoproducts Home
Library Home
Clarity Fog Eliminator
What is it used for?
To clean and protect lenses.
What's nano about it?
The dry wipes uses a self assembling nano-coating that changes the surface properties. After use, surfaces are dirt resistant, fog resistant and scratch resistant. Other coating can add bacterial resistance, increased conductivity, automatic dimming, anti static, and increased thermal control.
How does it work?
Some coatings are hydrophobic and resist dirt, chemicals, and other contaminants. it seals the surface and also resists fingerprints and oils. Some coatings are hydrophilic and allow water to spread reducing fog build up. This icreases clarity in very humid, cold, and hot climates. The surface can also be protected from scratches and other stresses.
Check the Nano Products Calendar for available dates!


Documentation Home
MySQL 5.7 Reference Manual
Related Documentation Download this Manual
PDF (US Ltr) - 35.4Mb
PDF (A4) - 35.6Mb
PDF (RPM) - 33.8Mb
EPUB - 8.5Mb
HTML Download (TGZ) - 8.3Mb
HTML Download (Zip) - 8.4Mb
HTML Download (RPM) - 7.2Mb
Eclipse Doc Plugin (TGZ) - 9.2Mb
Eclipse Doc Plugin (Zip) - 11.3Mb
Man Pages (TGZ) - 198.4Kb
Man Pages (Zip) - 302.4Kb
Info (Gzip) - 3.2Mb
Info (Zip) - 3.2Mb
Excerpts from this Manual
MySQL 5.7 Reference Manual / Data Types / Data Type Default Values
12.7 Data Type Default Values
The DEFAULT value clause in a data type specification indicates a default value for a column. With one exception, the default value must be a constant; it cannot be a function or an expression. This means, for example, that you cannot set the default for a date column to be the value of a function such as NOW() or CURRENT_DATE. The exception is that you can specify CURRENT_TIMESTAMP as the default for TIMESTAMP and DATETIME columns. See Section 12.3.5, "Automatic Initialization and Updating for TIMESTAMP and DATETIME".
BLOB, TEXT, GEOMETRY, and JSON columns cannot be assigned a default value.
If a column definition includes no explicit DEFAULT value, MySQL determines the default value as follows:
If the column can take NULL as a value, the column is defined with an explicit DEFAULT NULL clause.
If the column cannot take NULL as the value, MySQL defines the column with no explicit DEFAULT clause. Exception: If the column is defined as part of a PRIMARY KEY but not explicitly as NOT NULL, MySQL creates it as a NOT NULL column (because PRIMARY KEY columns must be NOT NULL). Before MySQL 5.7.3, the column is also assigned a DEFAULT clause using the implicit default value. To prevent this, include an explicit NOT NULL in the definition of any PRIMARY KEY column.
For data entry into a NOT NULL column that has no explicit DEFAULT clause, if an INSERT or REPLACE statement includes no value for the column, or an UPDATE statement sets the column to NULL, MySQL handles the column according to the SQL mode in effect at the time:
 - If strict SQL mode is enabled, an error occurs for transactional tables and the statement is rolled back. For nontransactional tables, an error occurs, but if this happens for the second or subsequent row of a multiple-row statement, the preceding rows will have been inserted.
 - If strict mode is not enabled, MySQL sets the column to the implicit default value for the column data type.
Suppose that a table t is defined as follows:
CREATE TABLE t (i INT NOT NULL);
In this case, i has no explicit default, so in strict mode each of the following statements produce an error and no row is inserted. When not using strict mode, only the third statement produces an error; the implicit default is inserted for the first two statements, but the third fails because DEFAULT(i) cannot produce a value:
INSERT INTO t VALUES();
INSERT INTO t VALUES(DEFAULT);
INSERT INTO t VALUES(DEFAULT(i));
See Section 6.1.7, "Server SQL Modes".
For a given table, you can use the SHOW CREATE TABLE statement to see which columns have an explicit DEFAULT clause.
Implicit defaults are defined as follows:
SERIAL DEFAULT VALUE in the definition of an integer column is an alias for NOT NULL AUTO_INCREMENT UNIQUE.
User Comments
Sign Up Login You must be logged in to post a comment.


Next: , Previous: , Up: Searching and Sorting [Contents][Index]
9.5 The hsearch function.
The functions mentioned so far in this chapter are for searching in a sorted or unsorted array. There are other methods to organize information which later should be searched. The costs of insert, delete and search differ. One possible implementation is using hashing tables. The following functions are declared in the header file search.h.
Function: int hcreate (size_t nel)
Preliminary: | MT-Unsafe race:hsearch | AS-Unsafe heap | AC-Unsafe corrupt mem | See POSIX Safety Concepts.
The hcreate function creates a hashing table which can contain at least nel elements. There is no possibility to grow this table so it is necessary to choose the value for nel wisely. The method used to implement this function might make it necessary to make the number of elements in the hashing table larger than the expected maximal number of elements. Hashing tables usually work inefficiently if they are filled 80% or more. The constant access time guaranteed by hashing can only be achieved if few collisions exist. See Knuth's "The Art of Computer Programming, Part 3: Searching and Sorting" for more information.
The weakest aspect of this function is that there can be at most one hashing table used through the whole program. The table is allocated in local memory out of control of the programmer. As an extension the GNU C Library provides an additional set of functions with a reentrant interface which provides a similar interface but which allows keeping arbitrarily many hashing tables.
It is possible to use more than one hashing table in the program run if the former table is first destroyed by a call to hdestroy.
The function returns a non-zero value if successful. If it returns zero, something went wrong. This could either mean there is already a hashing table in use or the program ran out of memory.
Function: void hdestroy (void)
Preliminary: | MT-Unsafe race:hsearch | AS-Unsafe heap | AC-Unsafe corrupt mem | See POSIX Safety Concepts.
The hdestroy function can be used to free all the resources allocated in a previous call of hcreate. After a call to this function it is again possible to call hcreate and allocate a new table with possibly different size.
It is important to remember that the elements contained in the hashing table at the time hdestroy is called are not freed by this function. It is the responsibility of the program code to free those strings (if necessary at all). Freeing all the element memory is not possible without extra, separately kept information since there is no function to iterate through all available elements in the hashing table. If it is really necessary to free a table and all elements the programmer has to keep a list of all table elements and before calling hdestroy s/he has to free all element's data using this list. This is a very unpleasant mechanism and it also shows that this kind of hashing table is mainly meant for tables which are created once and used until the end of the program run.
Entries of the hashing table and keys for the search are defined using this type:
Data type: struct ENTRY
Both elements of this structure are pointers to zero-terminated strings. This is a limiting restriction of the functionality of the hsearch functions. They can only be used for data sets which use the NUL character always and solely to terminate the records. It is not possible to handle general binary data.
char *key
Pointer to a zero-terminated string of characters describing the key for the search or the element in the hashing table.
char *data
Pointer to a zero-terminated string of characters describing the data. If the functions will be called only for searching an existing entry this element might stay undefined since it is not used.
Function: ENTRY * hsearch (ENTRY item, ACTION action)
Preliminary: | MT-Unsafe race:hsearch | AS-Unsafe | AC-Unsafe corrupt/action==ENTER | See POSIX Safety Concepts.
To search in a hashing table created using hcreate the hsearch function must be used. This function can perform a simple search for an element (if action has the value FIND) or it can alternatively insert the key element into the hashing table. Entries are never replaced.
The key is denoted by a pointer to an object of type ENTRY. For locating the corresponding position in the hashing table only the key element of the structure is used.
If an entry with a matching key is found the action parameter is irrelevant. The found entry is returned. If no matching entry is found and the action parameter has the value FIND the function returns a NULL pointer. If no entry is found and the action parameter has the value ENTER a new entry is added to the hashing table which is initialized with the parameter item. A pointer to the newly added entry is returned.
As mentioned before, the hashing table used by the functions described so far is global and there can be at any time at most one hashing table in the program. A solution is to use the following functions which are a GNU extension. All have in common that they operate on a hashing table which is described by the content of an object of the type struct hsearch_data. This type should be treated as opaque, none of its members should be changed directly.
Function: int hcreate_r (size_t nel, struct hsearch_data *htab)
Preliminary: | MT-Safe race:htab | AS-Unsafe heap | AC-Unsafe corrupt mem | See POSIX Safety Concepts.
The hcreate_r function initializes the object pointed to by htab to contain a hashing table with at least nel elements. So this function is equivalent to the hcreate function except that the initialized data structure is controlled by the user.
This allows having more than one hashing table at one time. The memory necessary for the struct hsearch_data object can be allocated dynamically. It must be initialized with zero before calling this function.
The return value is non-zero if the operation was successful. If the return value is zero, something went wrong, which probably means the program ran out of memory.
Function: void hdestroy_r (struct hsearch_data *htab)
Preliminary: | MT-Safe race:htab | AS-Unsafe heap | AC-Unsafe corrupt mem | See POSIX Safety Concepts.
The hdestroy_r function frees all resources allocated by the hcreate_r function for this very same object htab. As for hdestroy it is the program's responsibility to free the strings for the elements of the table.
Function: int hsearch_r (ENTRY item, ACTION action, ENTRY **retval, struct hsearch_data *htab)
Preliminary: | MT-Safe race:htab | AS-Safe | AC-Unsafe corrupt/action==ENTER | See POSIX Safety Concepts.
The hsearch_r function is equivalent to hsearch. The meaning of the first two arguments is identical. But instead of operating on a single global hashing table the function works on the table described by the object pointed to by htab (which is initialized by a call to hcreate_r).
Another difference to hcreate is that the pointer to the found entry in the table is not the return value of the function. It is returned by storing it in a pointer variable pointed to by the retval parameter. The return value of the function is an integer value indicating success if it is non-zero and failure if it is zero. In the latter case the global variable errno signals the reason for the failure.
ENOMEM
The table is filled and hsearch_r was called with a so far unknown key and action set to ENTER.
ESRCH
The action parameter is FIND and no corresponding element is found in the table.
Next: , Previous: , Up: Searching and Sorting [Contents][Index]


text:
Peach season has arrived, and what true blue Ontarian is not salivating for a basketful of this perfectly ripened tree fruit?
Well, for one, my friend Cort Egan. He has huge problems with peach fuzz.
"I love the taste of peaches," he says, "but I can't stand peach fuzz in my mouth. It makes my skin crawl. To me, it's like nails on a chalkboard."
Industry observers believe he's not alone.
"I've heard people say eating a peach is like eating a velour sweater," says veteran Toronto-based produce buyer and industry consultant Mike Mauti of Execulytics.
Read more: 'Google Earth for vineyards' helps growers keep crops healthy: The New Farm
However, in Ontario, peaches are a legacy fruit. Peach season is a sign that summer has reached full maturity.
Have your say
So, fuzz haters such as Egan are taking a different approach. More and more, they're patronizing peaches' smooth-skinned cousins, nectarines — so much so, that nectarines, which have been improved for better consumer acceptance, are being heralded as the next big thing in Ontario tender fruit.
Farmers such as Phil Tregunno, chair of the 250-member Ontario Tender Fruit Growers, are growing 300 hectares of nectarines in the province this year. That's about 15 per cent of all so-called tender fruit, comprising peaches, nectarines, plums, pears and apricots.
Tregunno, a fourth-generation fruit farmer, has nearly doubled his nectarine acreage this year. Other producers are doing the same; even though a newly planted tree takes up to four years to produce fruit, growers are confident consumers' ongoing zeal for local food will keep the buzz growing.
Tregunno says nectarines have come a long way since he started growing them a decade ago. Being relatively small, nectarines didn't have much curb appeal to consumers in grocery aisles.
And in the tender fruit world, size matters. Researchers at the University of Guelph, the Vineland Research Innovation Centre and elsewhere worked to create nectarines that have a sweet taste, cold tolerance and — most important, from a consumers' viewpoint — girth. Tregunno says thanks to new variety development, nectarines he now grows are about 25 per cent bigger than the ones he started with.
Consultant Mauti gets it. "Eye appeal is buy appeal," he says.
Unfortunately for nectarines, their eye appeal extends to insects. Like picky peach eater Egan, some insects are likewise repelled by a fuzzy coat. Nectarines and peaches often grow in the same orchards — Tregunno, for example, also grows 140 hectares of peaches — and that proximity makes nectarines a convenient choice for fuzz-hating bugs too.
Growers are also anticipating problems related to climate change. Tender fruit is delicate and highly susceptible to extra rain, cold, drought and heat from climate change.
"We're the canary in the coal mine," Tregunno says.
But when it comes to nectarines, it's worth it. Tregunno cites many cases where consumers have praised him for producing fresh tree-ripened tender fruit. Quality wise, it's superior in many ways to imports that have travelled thousands of miles and were picked unripe to endure the journey.
"Many people here have never had a fresh nectarine," Tregunno says. "When they do, they're thankful."
Nutritionists are nuts about nectarines
Ontario nectarines are low in calories and packed with nutrition, says Alison Duncan, a dietitian and human health and nutrition professor at the University of Guelph. Dietitians like nectarines because they're a source of vitamins C and A, potassium and dietary fibre, as well as lutein, which can improve eye health.
Preventing tender fruit spoilage naturally
Guelph researchers discovered a natural spoilage inhibitor called "hexanal" extends tender fruit shelf life up to 14 days. That's big news at home and abroad. Studies funded by Canada's International Development Research Centre show mangoes and bananas in India and Africa misted with hexanal stay fresh through their long journey to markets.
Owen Roberts is an agricultural journalist at the University of Guelph, and president of the 5,000-member International Federation of Agricultural Journalists. Follow him on Twitter @TheUrbanCowboy or contact him by email at _EMAIL_


Top Answer
User Avatar
Wiki User
Answered 2010-12-04 18:50:17
Conquest, acquisition of land, honor and, most of all, power.
User Avatar
Your Answer
Still Have Questions?
Related Questions
Did Charlemagne think that education was important?
Yes, very. Charlemagne encouraged educational reform.
What was Charlemagne belief?
Charlemagne felt that learning was extremely important and started what became known as the "Carolingian Renaissance".
Why Charlemagne important?
i guess cause he was a king of franks
Why is the sword so important to Charlemagne?
Charlemagne is said always to have carried a sword. Also his favorite sword is said to have been one called Joyeuse. Joyeuse is mentioned in literature many times, and remained important as a relic of Charlemagne's life. I have not seen a reason it was so important to Charlemagne, but the is a link to an article on it below.
Why did Charlemagne encourage learning?
Charlemagne appreciated the importance of education and regretted having missed out on education when he was a child. He realised that it was important for administration and good statesmanship.
Why was Charlemagne important?
If he wouldn't of have been there people would still be in the dark ages.
WHY is Charlemagne and important figure in European history?
i dont know im asking you..
Were Arts and learning important in the Age of Charlemagne?
Arts and learning were very important to Charlemagne. He founded schools and made policies designed to make his country literate. The period of his reign is called the Carolingian Renaissance because of the importance of culture in his time.
What is the area of Villiers-Charlemagne?
The area of Villiers-Charlemagne is 27.57 square kilometers.
Who was King Charlemagne?
A king that was named charlemagne
How many kids did Charlemagne have?
Charlemagne had many women he married and divorced. Charlemagne had at least 18 children.
What kind of man was Charlemagne?
Charlemagne was bad ass!!
Did Charlemagne kill his sons?
Charlemagne did not kill his sons.
What did Charlemagne led?
Charlemagne led The Franks, or The Germans
Was Charlemagne educated?
It is recorded that Charlemagne could not write, read.
When was Charlemagne born?
Charlemagne was born on April 2, 742.
What religion was Charlemagne in?
Christianity King Charlemagne was a Roman Catholic.
Who ruled after Charlemagne?
Louis the Pious ruled next after Charlemagne.
How many wife and kids did Charlemagne have?
charlemagne had NO kids with his wife.
When was Charlemagne building created?
Charlemagne building was created in 1967.
When was Manno Charlemagne born?
Manno Charlemagne was born in 1948.
When was Charlemagne Anyamah born?
Charlemagne Anyamah was born in 1938.
When was The Coronation of Charlemagne created?
The Coronation of Charlemagne was created in 1517.
What is the ISBN of The Charlemagne Pursuit?
The ISBN of The Charlemagne Pursuit is 9780345485793.
When was The Charlemagne Pursuit created?
The Charlemagne Pursuit was created in 2008.
Still have questions?


text:
BornAgain (_URL_) is a novel software package to simulate and fit small-angle neutron and x-ray scattering at grazing incidence. It provides a generic framework for modeling multilayer samples with smooth or rough interfaces and with various types of embedded nanoparticles.
This School will introduce students, instrument scientists, and both novice and experienced researchers working in the field of GISAS or reflectometry at large to new opportunities for simulating and fitting their data. In compact introductory lectures, we will outline the theory implemented in BornAgain, and explain the design of the software. Extensive hands-on tutorials will highlight practical aspects of GISAS simulation.
Registration is available at _URL_
At the User Meeting, users of BornAgain are kindly invited to share their experiences, to present first results, but also to report on difficulties, to suggest improvements and to request missing features. This feedback offers a unique opportunity to influence the further development of BornAgain.
For convenience of colleagues from overseas, this event is scheduled as a satellite of the GISAXS2016 workshop (_URL_ which takes place on November 16-18 in Hamburg.


misses true cases, at the cost of additional false alarms? As Luan, Schooler, & Gigerenzer (2011) have shown, you can easily shift the balance of errors in a fast and frugal tree by adjusting the decisions it makes at each level of a tree. The fft function automatically builds several versions of the same general tree that make different error trade-offs. We can see the performance of each of these trees in the bottom-right ROC curve. Looking at the ROC curve, we can see that tree number 5 has a very high hit-rate, but a smaller specificity. We can look at this tree by adding the tree = 5 argument to plot():
plot(breastcancer.fft,
 main = "Breastcancer FFT",
 decision.names = c("Healthy", "Cancer"),
 tree = 5)

Screen Shot 2016-08-16 at 15.21.31

Here is the resulting tree. As you can see, this tree uses an extra cue called nuclei.bar. This tree has a perfect hit rate of 100% (just as we wanted), but at a cost of a lower specificity of 80%.
Additional arguments
Cross-validation: The fft() function allows you to easily create trees from a training dataset, and test the performance of the trees with a test dataset (aka, cross-validation). You can do this by either entering an explicit test dataset in the data.test argument, or by randomly splitting the main dataset into a separate training and testing sample with train.p. For example, train.p = .5 will randomly split the data into a 50% training set, which will be used to build the trees, and a 50% test set, which will be used to evaluate their prediction performance.
# Create a 50% training and 50% testing dataset with train.p = .5
 breastcancer.test.fft <- fft(formula = diagnosis ~ ,
 data = breastcancer,
 train.p = .5)

Restricting trees: If you want to explicitly decide which cues you want in the tree, you can specify this in the formula argument. For example, the following code will generate a tree from the breast cancer data, but only using cues thickness, mitosis, and adhesion.
# Only use 3 cues in the trees
 breastcancer.r.fft <- fft(formula = diagnosis ~ thickness + mitoses + adhesion,
 data = breastcancer)
Summary
The FFTrees package contains lots of other functions for visualising and comparing trees. To see all the details, be sure to check out the package vignettes either in the package or on CRAN (here). For all you judgment and decision making researchers out there, I will also be presenting the package at the annual meeting of the Society for Judgment and Decision Making (SJDM) in Boston in November 2016
The package is also very much in development, so I am grateful for any recommendations, bug-reports, or criticisms. You can post bug-reports at _URL_ or email me directly at Nathaniel.D.P[email protected]
Coauthors
This package was developed in collaboration with Dr. Hansjoerg Neth and Dr. Wolfgang Gaissmaier at the University of Konstanz, and Dr. Jan Woike at the Max Planck Institute for Human Development in Berlin.
 References
Gigerenzer, G., & Brighton, H. (2009). Homo heuristicus: Why biased minds make better inferences. Topics in Cognitive Science, 1(1), 107–143.
Gigerenzer, G., & Todd, P. M. (1999). Fast and frugal heuristics: The adaptive toolbox. In Simple heuristics that make us smart (pp. 3–34). Oxford University Press.
Gigerenzer, G., Czerlinski, J., & Martignon, L. (1999). How good are fast and frugal heuristics? In Decision science and technology (pp. 81–103). Springer.
Gladwell, M. (2007). Blink: The power of thinking without thinking. Back Bay Books.
Green, L., & Mehr, D. R. (1997). What alters physicians' decisions to admit to the coronary care unit? Journal of Family Practice, 45(3), 219–226.
Jenny, M. A., Pachur, T., Williams, S. L., Becker, E., & Margraf, J. (2013). Simple rules for detecting depression. Journal of Applied Research in Memory and Cognition, 2(3), 149–157.
Malkiel, B. G. (1999). A random walk down Wall Street: including a life-cycle guide to personal investing. WW Norton & Company.
Marewski, J. N., & Gigerenzer, G. (2012). Heuristic decision making in medicine. Dialogues Clin Neurosci, 14(1), 77–89.
Luan, S., Schooler, L. J., & Gigerenzer, G. (2011). A signal-detection analysis of fast-and-frugal trees. Psychological Review, 118(2), 316.
To leave a comment for the author, please follow the link and comment on their blog: R – Nathaniel D. Phillips, PhD.
R-bloggers.com offers daily e-mail updates about R news and tutorials about learning R and many other topics. Click here if you're looking to post or find an R/data-science job.
Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.
Never miss an update!
Subscribe to R-bloggers to receive
e-mails with the latest R posts.
(You will not see this message again.)
Click here to close (This popup will not appear again)


Cost of Service and Tariffs
Determination of the cost of service is essential to have a clear understanding of the actual cost of delivering electricity to various customer categories and therefore ensure businesses make the right development decisions. Economic efficiency in tariff design requires tariffs to be linked to the economic cost of meeting consumers' demand. It includes identifying the efficient, rather than the actual, costs of electricity supply.
We support regulators in developing appropriate tariff frameworks and transitioning to cost-reflective tariffs. We also support utilities in tariff calculation and regulatory submissions.
Key services in this area:
 1. Design of tariff and subsidy regimes.
 2. Economic tariff setting.
 3. Generation and system expansion and long-term planning.
 4. Demand forecasting, business projections and financial analysis.
 5. Regulatory Submissions and Negotiations.
 6. Regulatory Financial Models.
 7. Long-run marginal cost determination.
 8. Opening Losses Calculation and loss reduction strategies.
 9. Billing system and settlement.
 10. Vesting Contract and Balancing Compensation Administration.
 11. Delivering social equity in tariff models and establishment of life-line tariff.
 12. Communicating tariff change to all stakeholders.


text:
🇧🇷 Switzerland is still the most innovative country
The World Intellectual Property Organization ranks Switzerland first, mainly thanks to its patents and high technology.
Switzerland remains the most innovative country in the world and is ahead of the United States, which overtakes Sweden. China is closing in on the top ten. Tensions affect innovation, the World Intellectual Property Organization (WIPO) said on Thursday in Geneva.
Switzerland occupies, for the twelfth consecutive year, the first place in the world index of this institution, which gathers dozens of indicators in more than 130 countries. He addresses topics such as patent families, high technology and the complexity of production and export.
According to a WIPO official, the combination of "strong" research, the ability to finance innovation and applications quickly by the private sector in economic markets explains this situation. "SMEs must be more innovative" in Switzerland, given the scarcity of raw materials and a small internal market, the Federal Institute of Intellectual Property told Keystone-ATS, explaining this new success.
Swiss research has long spawned start-ups, he says. For a country like Switzerland, intellectual property is "very important", he points out.
In addition to the top three, Great Britain regains fourth place, ahead of the Netherlands. In the next five to 10 years, the composition of the 20 most innovative countries "should be more diverse," WIPO Director-General Daren Tang told reporters. The situation must reflect changes in patent applications, he insisted.
Despite the pandemic, investments in innovation around the world continued to grow last year. But there are difficulties in obtaining concrete effects, in particular due to the insufficiently rapid diffusion of new technologies, such as artificial intelligence (AI). The organization wants a wave of innovation in these issues or in biotechnologies.
For this year, the situation is "clouded" by global uncertainties and "persistent underperformance in innovation-driven productivity", Tang said. He calls innovation that is followed by an impact on the economy, especially for small businesses and developing countries.
In the same way, "an environment with political tensions affects innovation", the CEO also believes. However, it can accelerate, adds the organization. The energy and food crisis may lead to an increased need for some countries to facilitate innovation to ensure their food security.
Investments in renewable energy and technologies to combat climate change can expand. In total, those of top innovative companies increased by 10% in 2021, reaching over $900 billion, more than before the pandemic. This improvement is particularly linked to new technologies, pharmaceutical and biotechnological.
Venture capital schemes increased by 46% and Latin America is the region where they are making the most progress. But we should expect more difficulties in this situation this year, also says the PMOI. In total, the numbers for the second quarter show a drop of 25 to 35% compared to the same period last year. The situation should get even worse by the end of the year, adds the organization.
Did you find an error?Please let us know.


Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
In Git, file contents are stored in blob objects. Tree objects represent a directory. They list the files in the directory, and the blob in which the file contents are stored. They also list subdirectories, and the tree that represents the subdirectory. In this sense, a tree in Git is a recursive data structure: it can contain references to itself.
The alternative would be a non-recursive data structure, where a single tree object would list all tracked files in the repository, and store not only the filename, but the full path relative to the root of the repository.
I admire the elegant way in which Git treats data, so I am convinced there must be a good reason why Git uses the recursive form. I came up with several reasons, all of which I discarded:
 - A tree per subdirectory would allow tracking directories. It could enable tracking empty directories. Storing directory metadata is more elegant in recursive form (the non-recursive tree would require two types of entry to track subdirectories).
 However, Git does not track empty directories, nor does it store directory metadata.
 - Recursive trees allow unchanged subdirectories to share the same tree among commits. This would be more space efficient in a repository with many files, where only a few files change per commit, especially when many subdirectories are used.
 However, space efficiency is not a concern in tree objects: packfiles take care of compression, and the non-recursive trees might even be better compressible because they contain less hashes (which are essentially random). Additionally, the data-to-files ratio will generally be large, so the size of the tree objects has little impact on the repository size.
 - Recursive trees might allow for more elegant algorithms. Operations on the repository can be handled recursively.
 However, (perhaps recursively) building a list of all files in the repository, and then operating on the flat list, is in many cases even easier.
 - Recursive trees could allow for easier detection of directory renames.
 However, Git uses heuristics to detect renames anyway, so this is of little use.
I am unsure about the differences in performance. It is not obvious to me that one of the two representations would be faster.
My question is: why is the recursive form used? Is there a specific advantage to using the this form?
share|improve this question
2
"Recursive trees allow unchanged subdirectories to share the same tree among commits. This would be more space efficient in a repository with many files, where only a few files change per commit, especially when many subdirectories are used." --- i think you hit the nail on the head in your question. – xero Aug 5 '13 at 18:27

you seem to be assuming that non-recursive is the default, and there's needs to be a reason for recursive. in my experience, if you're storing trees, you automatically choose a recursive structure, because it tends to work better for all the reasons you list. so even if there's no obvious single explanation, that's the "normal" way to do it. – andrew cooke Aug 5 '13 at 19:19
add comment
Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.
Your Answer

discard
By posting your answer, you agree to the privacy policy and terms of service.
Browse other questions tagged or ask your own question.


text:
Give your macro a name.
To actually write a macro, you'd type the word Sub in the module window. (Why? It doesn't matter. It's just that way.) Next you'd type a space and then the name of your macro. If you typed Sub MyMacro, for instance, you'd create a new macro called MyMacro. Because the Visual Basic Editor is so smart, it would automatically insert a line below your Sub line that said End Sub — how convenient! You've got the beginning and the end, now all you need is some code between them, in the handy new space.


Do you have a Bible question for Stephen? Ask it HERE.
Why is Jesus called "the Lion of Judah"?
Barbara from Florida asked, In Rev. 5:5, why is Jesus called "the Lion of Judah"?
To answer your question we need to go back to the Old Testament. We read this in the book of Genesis:
[8] "Judah, your brothers shall praise you; your hand shall be on the neck of your enemies; your father's sons shall bow down before you. [9] Judah is a lion's cub; from the prey, my son, you have gone up. He stooped down; he crouched as a lion and as a lioness; who dares rouse him? [10] The scepter shall not depart from Judah, nor the ruler's staff from between his feet, until tribute comes to him; and to him shall be the obedience of the peoples. [11] Binding his foal to the vine and his donkey's colt to the choice vine, he has washed his garments in wine and his vesture in the blood of grapes. [12] His eyes are darker than wine, and his teeth whiter than milk (Genesis 49:8–12 ESV).
In that passage, Jacob was giving a prophetic address to each of his sons. When he came to Judah, he said that one would come from that tribe and would reign forever. Jacob used the imagery of a lion to refer to this ruler. Lions are strong and powerful and greatly feared. Hardly anyone would dare to mess with them.
So, when Jesus is called "the Lion of Judah" it is because He's the fulfillment of that prophecy. He's the promised one who reigns forever, strong and powerful like a lion.
Thanks for your question,
Add a Comment


go.pkt
module
Version: v0.0.0-...-c97f47a Latest Latest
Warning
This package is not in the latest version of its module.
Go to latest
Published: Feb 9, 2020 License: BSD-2-Clause
README
go.pkt
Travis CI
go.pkt provides Go libraries for capturing, injecting, filtering, encoding and decoding network packets.
 - capture: provides the basic interface for packet capturing and injection. Different implementations ("pcap", "file", ...) are provided as subpackages.
 - filter: provides an API for compiling and manipulating BPF filters. A filter can be either compiled from tcpdump-like expressions, or created from basic BPF instructions. Filters can then be either applied to packet sources (see the capture package) or directly run against binary data.
 - packet: provides the interfaces for implementing packet encoders and decoders. Every supported protocol implements the Packet interface as a submodule of this package (e.g. packet/ipv4, packet/tcp, ...).
 - layers: provides utility functions for encoding and decoding packets to/from binary data. Differently from the basic "packet" interface, this can encode and decode complete "stacks" of packets, instead of manipulating single ones.
 - network: provides utility functions for sending and receiving packets over the network. Basically, it hides some of the complexity of using the capture and layers packages together.
 - routing: provides network routing information about the system. It can either return all available routes or select a specific route depending on a destination address.
Getting Started
Capturing
Packet capturing is done using a packet "source" such as a network interface or a dump file.
In the following example we create a "pcap" capture handle using the eth0 network interface, we activate it and then capture packets using the Capture() method.
src, err := pcap.Open("eth0")
if err != nil {
 log.Fatal(err)
}
defer src.Close()
// you may configure the source further, e.g. by activating
// promiscuous mode.
err = src.Activate()
if err != nil {
 log.Fatal(err)
}
for {
 buf, err := src.Capture()
 if err != nil {
 log.Fatal(err)
 }
 log.Println("PACKET!!!")
 // do something with the packet
}
Injection
Similarly to packet capturing, packet injection requires a capture handle.
In the following example we create a capture handle like before and then use the Inject() method to send some data (we'll see later how to encode data in the propert formats).
dst, err := pcap.Open("eth0")
if err != nil {
 log.Fatal(err)
}
defer dst.Close()
// you may configure the source further, e.g. by activating
// promiscuous mode.
err = dst.Activate()
if err != nil {
 log.Fatal(err)
}
err = dst.Inject([]byte("random data"))
if err != nil {
 log.Fatal(err)
}
Filtering
Packet filtering is done by creating a filter (e.g. by compiling it from an expression) which can be either applied to a capture handle (by using the ApplyFilter() method) or used directly against a data buffer.
In the following example we create a filter by compiling a tcpdump-like expression and then try to match some data against it.
// Match UDP or TCP packets on top of Ethernet
flt, err := filter.Compile("udp or tcp", packet.Eth)
if err != nil {
 log.Fatal(err)
}
if flt.Match([]byte("random data")) {
 log.Println("MATCH!!!")
}
Encoding
Encoding packets is done by using the functions provided by the layers package.
In the following example we create an ARP packet on top of an Ethernet packet and we encode them to binary data by using the Pack() method. Note that you'll need to import the packages of the protocols used (packet/eth and packet/arp).
// Create an Ethernet packet
eth_pkt := eth.Make()
eth_pkt.SrcAddr, _ = net.ParseMAC("4c:72:b9:54:e5:3d")
eth_pkt.DstAddr, _ = net.ParseMAC("ff:ff:ff:ff:ff:ff")
// Create an ARP packet
arp_pkt := arp.Make()
arp_pkt.HWSrcAddr, _ = net.ParseMAC("4c:72:b9:54:e5:3d")
arp_pkt.HWDstAddr, _ = net.ParseMAC("00:00:00:00:00:00")
arp_pkt.ProtoSrcAddr = net.ParseIP("192.168.1.135")
arp_pkt.ProtoDstAddr = net.ParseIP("192.168.1.254")
buf, err := layers.Pack(eth_pkt, arp_pkt)
if err != nil {
 log.Fatal(err)
}
// do something with the packet
log.Println(buf)
Decoding
Like encoding, decoding is done by using the functions provided by the layers package.
The following example uses the UnpackAll() function to decode a whole chain of packets (e.g. ethernet -> ipv4 -> udp).
// Create the buf data
buf := []byte("random data")
// Assume Ethernet as datalink layer
pkt, err := layers.UnpackAll(buf, packet.Eth)
if err != nil {
 log.Fatal(err)
}
log.Println(pkt)
Network
Instead of using the layers and capture packages together, the network package can be used instead.
The following example creates an ARP request packet and uses SendRecv() to send it and receive a suitable answer.
c, err := pcap.Open("eth0")
if err != nil {
 log.Fatal(err)
}
defer c.Close()
err = c.Activate()
if err != nil {
 log.Fatal(err)
}
// Create an Ethernet packet
eth_pkt := eth.Make()
eth_pkt.SrcAddr, _ = net.ParseMAC("4c:72:b9:54:e5:3d")
eth_pkt.DstAddr, _ = net.ParseMAC("ff:ff:ff:ff:ff:ff")
// Create an ARP packet
arp_pkt := arp.Make()
arp_pkt.HWSrcAddr, _ = net.ParseMAC("4c:72:b9:54:e5:3d")
arp_pkt.HWDstAddr, _ = net.ParseMAC("00:00:00:00:00:00")
arp_pkt.ProtoSrcAddr = net.ParseIP("192.168.1.135")
arp_pkt.ProtoDstAddr = net.ParseIP("192.168.1.254")
rsp_pkt, err := network.SendRecv(c, 0, eth_pkt, arp_pkt)
if err != nil {
 log.Fatal(err)
}
log.Println(rsp_pkt)
Routing
TODO
For more examples have a look at the examples directory in the source repository.
Dependencies
 - libpcap
Copyright (C) 2014 Alessandro Ghedini _EMAIL_
See COPYING for the license.
Directories
Path Synopsis
Provides the basic interface for packet capturing and injection.
Provides the basic interface for packet capturing and injection.
file
Provides native packet capturing and injection on pcap dump files without requiring the libpcap library.
Provides native packet capturing and injection on pcap dump files without requiring the libpcap library.
pcap
Provides packet capturing and injection on live network interfaces via libpcap.
Provides packet capturing and injection on live network interfaces via libpcap.
examples
arp
Provides an API for compiling and manipulating BPF filters.
Provides an API for compiling and manipulating BPF filters.
Provides utility functions for encoding and decoding packets to/from binary data.
Provides utility functions for encoding and decoding packets to/from binary data.
Provides utility functions for sending and receiving packets over the network.
Provides utility functions for sending and receiving packets over the network.
Provides the interfaces


We use cookies to personalise content and advertisements and to analyse access to our website. Furthermore, our partners for online advertising receive pseudonymised information about your use of our website. cookie policy and privacy policy.

+0

0
69
2
avatar
What is the total number of primes between 1 and 1,000,00? Also, what is their total sum? Use computers or spread sheets to get the answer. Thanks for any help.
P.S. I have the answer to both, but just want verification.
 Jan 14, 2019
 #1
avatar+533
0
whaaaaa... lol
 Jan 14, 2019
 #2
avatar
+1
This must be given to you by your teacher as an exercise in learning how to use a "spreadsheet" or how to write a computer code(if you are studying coding) to see if you can do it! At least, that is what I think! The number of primes between 1 and 1,000,000 can be esily obtained from numerous sources on the Internet and elsewhere. However, summing them all up is quite a different matter altogether!.
If you have any experience in coding, in any programming language, this is a trivial matter! Since I have some experience in coding in a couple of languages, this is a very simple project which takes a couple of minute to write, and a couple of milliseconds to run. As a result, here are the numbers you are looking for:
Number of primes between 1 and 1,000,000 = 78,498. And their total sum =37,550,402,023.
Good luck!.
 Jan 14, 2019
5 Online Users


text:
July 24, 2012 8:00 am
The humans at the olympics are at the height of athletic achievement, finely engineered bodies for very specific tasks. But beneath their feet is another highly engineered entity: the track.
London's track was designed by Mondo, the same company who designed the track for Barcelona's Olympics, back in 1992. There are a few cool things about the Mondo track, the BBC reports:
Unlike other track designs that combine traction and shock-absorption in an upper layer of rubber granules, the Mondo track separates these functions, with a cushion backing for shock absorption and a solid upper layer that optimises slip resistance, traction and durability.
That means that the spikes that some athletes wear on their shoes to grab onto the track don't need to be as long to get a good hold. Which, if you're a sprinter, is great, because that means less energy is going into penetrating the track and then ripping those spikes out as you run. It might seem like a tiny difference, but when a race is won by fractions of a second, every bit counts.
Another cool thing about the track is how the rubber layers are stuck together. Joe Hoekstra, the man in charge of Mondo's projects in London, explained the process to the BBC. "The two layers are vulcanized, a process which cross links the molecular structure of the different materials and makes the surface more uniform, stronger and elastic."
Perhaps the key component of any track is its springiness. Runners want as much energy back from the track as they can get. But tracks that are too springy aren't good either, since they don't allow the foot to roll naturally as it hits the ground.
Just like throwing a javelin, or running a mile, the track in London has to keep a fine balance of spring, durability and grip.
More from Smithsonian.com:
Sign up for our free email newsletter and receive the best stories from Smithsonian.com each week.
No Comments »
No comments yet.


Chapter 12: Discovery Management
This chapter discusses some utility classes that make it easier to deal with lookup services.
12.1. Management Interfaces
Both services and clients need to find lookup locators. Services will register with these locators, and clients will query them for suitable services. Finding these lookup locators involves three components:
 1. A list of LookupLocators for unicast discovery
 2. A list of groups for lookup locators using multicast discovery
 3. Listeners whose methods are invoked when a service locator is found
The chapter "Discovering a Lookup Service" considered the cases of a single unicast lookup service, or a set of multicast lookup services. There are also mechanisms to handle a set of unicast lookup services and a set of multicast lookup services. There are three interfaces involved in this
 1. DiscoveryManagement which looks after discovery events
 2. DiscoveryGroupManagement which looks after groups and multicast search
 3. DiscoveryLocatorManagement which looks after unicast discovery
Different classes may implement different combinations of these three interfaces. The class LookupDiscovery discussed in chapter three uses DiscoveryGroupManagement and DiscoveryManagement. This performs multicast search, informing its listeners when lookup services are discovered. The class LookupLocatorDiscovery is discussed later in this chapter. It performs a similar task for unicast discovery. It implements the two interfaces DiscoveryLocatorManagement and DiscoveryManagement. Another class discussed later is LookupDiscoveryManager which handles both unicast and broadcast discovery, and so implements all three interfaces. With these three cases covered, it is unlikely that you will need to implement these interfaces yourself.
The DiscoveryManagement interface is
package net.jini.discovery;
public interface DiscoveryManagement {
 public void addDiscoveryListener(DiscoveryListener l);
 public void removeDiscoveryListener(DiscoveryListener l);
 public ServiceRegistrar[] getRegistrars();
 public void discard(ServiceRegistrar proxy);
 public void terminate();
}
The method addDiscoveryListener() is the most important of these, as it allows a listener object to be informed whenever a new lookup service is discovered.
The DiscoveryGroupManagement interface is
package net.jini.discovery;

public interface DiscoveryGroupManagement {

 public static final String[] ALL_GROUPS = null;
 public static final String[] NO_GROUPS = new String[0];

 public String[] getGroups();
 public void addGroups(String[] groups) throws IOException;
 public void setGroups(String[] groups) throws IOException;
 public void removeGroups(String[] groups);
}
The most important of these is setGroups(). If the groups have initially been set to NO_GROUPS, no multicast search is performed. If it is later changed by setGroups() then this initiates search. Similarly, addGroups() will also initiate search. (This is why they may throw remote exceptions.)
The third interface is DiscoveryLocatorManagement
package net.jini.discovery;
public interface DiscoveryLocatorManagement {
 public LookupLocator[] getLocators();
 public void addLocators(LookupLocator[] locators);
 public void setLocators(LookupLocator[] locators);
 public void removeLocators(LookupLocator[] locators);
}
An implementation will generally set the locators in its own constructor, so these methods will probably only be useful if you need to change the set of unicast addresses for the lookup services.
12.2. LookupLocatorDiscovery
In the chapter on ''Discovering a Lookup Service'', the section on finding a lookup service at a known address only looked at a single address. If lookup services at multiple addresses are required, then a naive solution would be to put the code from that chapter into a loop. The LookupLocatorDiscovery class provides a more satisfactory solution by providing the same event handling method as in the multicast case: that is, you supply a list of addresses, and when a lookup service is found at one of these address, a listener object is informed.
The class is specified by
package net.jini.discovery;
public class LookupLocatorDiscovery implements DiscoveryManagement,
 DiscoveryLocatorManagement {
 public LookupLocatorDiscovery(LookupLocator[] locators);
 public LookupLocatorDiscovery(LookupLocator[] locators,
 Configuration config);
 public LookupLocator[] getDiscoveredLocators();
 public LookupLocator[] get UndiscoveredLocators();
}
An additional constructor has been added in Jini 2.0
Rewriting the unicast example from the chapter "Discovering a Lookup Service" using this utility class makes it look much like the example on multicast discovery from the same chapter. The similarities are that it now uses the same event model for lookup service discovery, the differences are that it uses a set of LookupLocator objects rather than a set of groups.
package discoverymgt;
import net.jini.discovery.LookupLocatorDiscovery;
import net.jini.discovery.DiscoveryListener;
import net.jini.discovery.DiscoveryEvent;
import net.jini.core.lookup.ServiceRegistrar;
import net.jini.core.discovery.LookupLocator;
import java.net.MalformedURLException;
import java.rmi.RMISecurityManager;
/**
 * UniicastRegister.java
 */
public class UnicastRegister implements DiscoveryListener {

 static public void main(String argv[]) {
 new UnicastRegister();
 // stay around long enough to receive replies
 try {
 Thread.currentThread().sleep(10000L);
 } catch(java.lang.InterruptedException e) {
 // do nothing
 }
 }

 public UnicastRegister() {
 // install suitable security manager
 System.setSecurityManager(new RMISecurityManager());
 LookupLocatorDiscovery discover = null;
 LookupLocator[] locators = null;
 try {
 locators = new LookupLocator[] {new LookupLocator("jini://localhost")};
 } catch(MalformedURLException e) {
 e.printStackTrace();
 System.exit(1);
 }
 try {
 discover = new LookupLocatorDiscovery(locators);
 } catch(Exception e) {
 System.err.println(e.toString());
 e.printStackTrace();
 System.exit(1);
 }
 discover.addDiscoveryListener(this);
 }

 public void discovered(DiscoveryEvent evt) {
 ServiceRegistrar[] registrars = evt.getRegistrars();
 for (int n = 0; n < registrars.length; n++) {
 ServiceRegistrar registrar = registrars[n];
 // the code takes separate routes from here for client or service
 System.out.println("found a service locator");
 }
 }
 public void discarded(DiscoveryEvent evt) {
 }
} // UnicastRegister
12.3. LookupDiscoveryManager
An application (client or service) that wants to use a set of lookup services at fixed, known addresses and also to use whatever lookup services it can find by multicast can use the utility class LookupDiscoveryManager. Most of the methods of this class come from its interfaces:
package net.jini.discovery;
public class LookupDiscoveryManager implements DiscoveryManagement,
 DiscoveryGroupManagement,
 DiscoveryLocatorManagement {
 public LookupDiscoveryManager(String[] groups,
 LookupLocator[] locators,
 DiscoveryListener listener)
 throws IOException;
 public LookupDiscoveryManager(String[] groups,
 LookupLocator[] locators,
 DiscoveryListener listener,
 Configuration config)
 throws IOException,
 ConfigurationException;
}
This differs from LookupDiscovery and LookupLocatorDiscovery in that it insists on a DiscoveryListener in its constructor. Programs using this can follow the same event model as the last example:
package discoverymgt;
import net.jini.discovery.LookupDiscoveryManager;
import net.jini.discovery.DiscoveryGroupManagement;
import net.jini.discovery.DiscoveryListener;
import net.jini.discovery.DiscoveryEvent;
import net.jini.core.lookup.ServiceRegistrar;
import net.jini.core.discovery.LookupLocator;
import java.net.MalformedURLException;
import java.io.IOException;
import java.rmi.RemoteEx


Individual Talk
Osho Audiobook - Individual Talk: Dang Dang Doko Dang, # 1, (mp3) - zen, prayer, hegel
Availability: In stock
Freedom Is To Know That Which Is
Talk #1 of the Series, Dang Dang Doko Dang
"Truth is one, but it can be approached in many ways. Truth is one, but it can be expressed in many ways. Two ways are very essential; all the ways can be divided into two categories. It will be good to understand that basic polarity. Either you approach truth through the mind or you approach truth through the heart. So there are two types of religions in the world – both true, both meaningful, but both opposite to each other – the religion of the mind and the religion of the heart.
"The religion of the mind believes that if you become thoughtless, if the mind is dropped, you attain to truth. The mind is the barrier; the no-mind will be the gate. Buddhism, Jainism, Taoism – these are the religions of the mind."
DetailsMake Your Selection... Or Choose All AudioBook Titles Minutes
Osho International
96 mins
0 MB
Osho continues:
"They are religions of deep analysis, religions of deep awareness, religions of enlightenment.
"Then there are religions of the heart: Judaism, Christianity, Islam, Hinduism. They believe that the path goes through the heart, that the heart has to be dissolved into the beloved, into the divine.
"The first religions are the religions of meditation. The word meditation is not exactly right but there is no other word to translate dhyana into English, because the language has never known a religion of meditation so the word does not exist. All Western languages, in fact, have known only the religion of the heart so they have the perfect word for that path – prayer. But for dhyana they don't have any word so meditation is the only word that can be used. In fact, dhyana means exactly the opposite; dhyana means just the contrary. The word meditation comes from a Greek root medonai which means to think about. The word meditation means to think about, and dhyana, which we are translating as meditation, means how not to think about; how to be in a state of no thought; how to come to a point where you are but there is no thinking; a state of no-mind, pure awareness. But meditation is the only word, so we will use it.
"Zen is the culmination of the Buddhist search. Zen is the uttermost flowering of the path of meditation. The word zen comes from dhyana. Dhyana became ch'an in China, then ch'an became zen in Japan. Remember this: Zen originated in India with Gautam Buddha. When Gautam Buddha attained to his ultimate enlightenment, the state of no-mind, the world came to know the path of analysis, the path of right thinking, the path of right remembering, and the path of how to dissolve all thinking by becoming more and more aware of thoughts. Just by watching thoughts, slowly, slowly, they fade out – you become simply a watcher, you are not identified with your thinking, you stand aside and you go on watching, just as if you are standing by the side of the road and watching the traffic. The mind is like traffic, very circular, goes on moving in a circle, very repetitive, almost a mechanism."
In this title, Osho talks on the following topics:
zen… prayer… pretend… space… beautiful… solution… scientific… adventure… hegel… maharishi
Email this page to your friend