Hey!
about
I am a full stack software engineer, mainly focused on the web development. Currently I work at Appknox, developing some of the most cutting-edge mobile security tools on the market. I’m very passionate about innovative approach of Clean, Scalable, High performance and easily understandable code. I like to work on challenging Freelance projects. Till now, I've worked on projects based on Python and Laravel, CakePHP and CodeIgniter. While I'm not busy in coding I like to watch YouTube videos(casey neistat is my favourite youtuber) and improve my photography skills.
I am a complete social animal. Find me on GitHub & LinkedIn & Twitter. Experience my photography skills on Instagram. Follow up with my blogs on Medium
technical skills
As a reluctant developer, I fled from a traditional path and explored my creativity, trough trying my hands on various techniques and software. Software is more than just a tool, and I try to dig deep into it. Today, I knack for critical thinking, empathy and creativity to create viable and impactful solutions using these technologies.
work
education
I spent 3 years learning Computer Science, Physics and Mathematics and got my Bachelor degree in Computer Science and Technology in 2016 and started working as a Web Application developer. I think one should never stop learning and go through a process of acquiring knowledge.
experience
Appknox helps developers and enterprises to uncover and fix security loopholes in mobile applications. Being in a very well structured startup, with clear and defined work procedures, helped me grow both personally and professionally, as well as enjoying a young and enthusiastic working environment. I had the opportunity to redefine the way I work in a more intelligent way.
As a Freelancer I have worked on vairous projects from small scale E-Commerece Projects to Large Data Exrtaction Projects.
Working closely with client and coordinating with project manager to deliver product within stipulated time. Understanding clients requirement and implementing them with creativity. Collaborating with designer to bring out the best outcome. Worked on several projects from Front End development to Back End..
In this small yet expanding company, I had the opportunity to turn my passion for the web in a job right after graduation. Being the web developer in the company I have often dealt with the whole process of designing and development for our customers.
clients
contact
Hello , I'd love to hear from you.
{{ resultMessage }}
Or simply email me at subham.bhattacharjee1@gmail.com


Roster Guru is designed to take the pain out of generating and maintaining duty rosters.
Learn more
By David Key © 2018


A product designer passionate about bridging gaps between people and their goals by translating needs to empathetic design.
📍 Greater Seattle Area, WA


--- layout: archive title: Zulip Chat Archive permalink: /stream/116395-maths/topic/Arithmetic.20Basics.20in.20Lean.html ---
def even (n : ℕ) : Prop := ∃ k, n = 2*k def odd (n : ℕ) : Prop := ∃ k, n = 2*k+1 lemma luckyseven : odd 7 := begin rw odd, existsi 3, end
"existsi 3," takes the goal to 7 = 2*3+1, but I'm not sure how to get it to evaluate the expression
7=2*3+1
is true by definition so you can finish the proof with refl
Okay thanks
If you put ```lean
above your code and ```
under it, you'll get syntax highlighting etc.
If you use mathlib and write import tactic
at the top of your code, you can use the slightly less bizarrely named use
tactic: use 3
does the same as existsi 3
.
1 goal d k : ℕ, q : d = 2 * k + 1 ⊢ nat.succ d = 2 * (k + 1)
I'm also not sure how to deal with this goal, specifically how to distribute the multiplication over the addition at the start
Big question: do you just want to destroy this quickly with a tactic which proves all such equalities in general rings, or do you want to do all the steps by yourself?
Either of these seems fine to me
If the former, then rw q, ring
(assuming you have mathlib tactics imported)
"import tactic" didn't work for me
if the latter, then rw mul_add
is what you need to apply the distributivity. It's also called left_distrib
or something, but mul_add
is easier to remember.
Alright thanks
import tactic
not working just means that you don't have Lean's maths library set up to work with your project.
https://github.com/leanprover-community/mathlib#installation and then download the sample project and make a new file in it with your Lean code and it will work. Alternatively use the online editor
The natural number game teaches you stuff like mul_add
(disclaimer: I was involved in writing it)
Last updated: Apr 24 2020 at 19:02 UTC


Public Statement: Please Read
Grab a controller, a wumpus plush and play with a SoftSoap™ enthusiastic friend..
+ receive a complimentary SoftSoap™*
Our game has been made from the ground up to support mobile devices.
Screenshot your favourite moments and tweet the team @ClubWumpus
As always, Club Wumpus™ will be free to play. With additional freemium items.
If you have a Discord Gold account, connect it with Club Wumpus™ and receive a complimentary SoftSoap™!
We new Wumpus friends!


A low level binding to the FreeType library
FreeType is a library to read and rasterize font files. This module is a thin wrapper around FreeType's C API.
All support is done through the Lua mailing list.
Feel free to ask for further developments. I can't guarantee that I'll develop everything you ask, but I want my code to be as useful as possible, so I'll do my best to help you. You can also send me request or bug reports (for code and documentation) directly at<EMAIL_ADDRESS>This module is written and maintained by Jérôme Vuarand.
It is available under an MIT-style license.
LuaFreeType sources are available in its Mercurial repository:
hg clone http://hg.piratery.net/luafreetype/
Tarballs of the latest code can be downloaded directly from there: as gz, bz2 or zip.
Finally, I published some rockspecs:
luarocks install freetype
This module is a low level binding to FreeType, so the API stays as close as possible. Basically all FreeType functions with an FT_
prefix are functions in the module without the prefix, and arguments and return values are very similar. In other words you should consult the FreeType documentation, apply some logic to adapt that to Lua, and eventually check this module sources to find peculiarities.
As the API is very similar to the FreeType C API, no detailed documentation will be maintained here. If that proves to be problematic, please let me know, and I'll see if I can improve that.
To use this module:
local FT = require 'freetype'
Here I named the module FT
, so that you can write FT.New_Library
to keep your code similar to C code using the FreeType C API, in this case FT_New_Library
. Of course you can name your local whatever you want.
Finally note that this binding is not automatically generated, so it is (very) incomplete so far. Please contact me if something you need is missing.


{{USP_SaoCarlos-Brazil/IARA}}
Our project look for create an organism that is able of reducing the concentration of heavy metals in aqueous solutions, focusing on mercury. We’ll intend to induce expression and secretion of a protein which is able to bind with the heavy metals and bacterial biofilm formation, in E.coli cells.
We went through a process of searching and discussing possible problems that we could solve using Synthetic Biology and we noticed that all the team has affection for environmental causes and bioremediation. Then, we remembered two environmental "disasters" that had national repercussions: the rupture of the dams of Brumadinho-MG (2019) and Mariana-MG (2015). On both occasions, the rupture of the dams caused pollution with heavy metals of the Paraopeba river (Brumadinho), Doce river (Mariana) and the affluent rivers in each region. Researches using aliquots of water from these rivers showed that some of the heavy metals in the highest concentration were mercury and lead. We had the idea of transforming a bacteria that it is able to capture heavy metals. We were inspired by the 2014 project from another Brazilian team, UFAM_Brazil. In addition, we wanted to facilitate the removal of the bacteria from the environment and for this, we had the idea of inducing the formation of a bacterial biofilm, since the bacteria will all be in the biofilm community. Another interesting point of our project is that in order to increase the survival of the bacteria: the heavy metals will not get trapped inside them, but will bind to the metal-capturing proteins that will be secreted and will be adhered to the biofilm by a tag attached to the biofilm cellulose, which is one of the main components of the biofilm matrix that will be formed.
The main goals of our project are to ensure expression and secretion of the protein that captures heavy metals and also to effectively induce bacterial biofilm formation. For this, after an extensive period of research and discussion, we formulated some biological circuits that would be able to express and secrete the protein separately and others that are capable of guaranteeing the simultaneous expression and secretion of the protein, and the formation of the biofilm. In this way could facilitate the diagnosis of possible bacterial transformation errors. In addition, in order to achieve the goal of performing protein secretion, we had to add in our circuit components of a protein complex responsible for secretion that has a good chance of being adaptable to the chassis we intend to use. In order to induce the formation of biofilm, we added in the circuit a protein that presents the GGDEF domain capable of increasing the level of C-di-GMP present in the bacteria, which in turn will be responsible for inducing biofilm formation.


Dice Game
Score 20 will loose your current score
First level winning score is 30
Second level winning score is 50
Start Game
Play
Play again
Level 3
00.00
Start Game
Anayt is
playing


User Name
Edit Name
E-MAIL
<EMAIL_ADDRESS>Edit E-mail
PASSWORD
··········
Reset Password
Edit Profile
×
First name:
Last name:
E-mail:
Submit
Cancel
Reset Password
×
Current Password:
Current password is invalid.
New Password:
Confirm New Password:
Confirmation of new password is not same with new password.
Submit
Cancel
Loading...


Money Game. How should Red play 54?
pips Red=143 White=120
(CorrectAnswer= 0/0, ErrorScore= 0)
Not the roll Red was hoping for!
There is no better 5 than covering with 8/3. It is then a choice between 21/17, 13/9 or 8/4.
21/17 is the wrong idea because Red would like to make an anchor in White's home board and so he should leave both blots where they are. 8/4 allows a number of calamitous double hits and so by elimination we are left with 13/9 which creates another blot but at least duplicates White's 1's and 2's. Barring 11, 22 and 44 Red will only have one blot on the next time and a reasonable chance of survival.
The key thing here is to determine Red's plan before making your move.
There is no better 5 than covering with 8/3. It is then a choice between 21/17, 13/9 or 8/4.
21/17 is the wrong idea because Red would like to make an anchor in White's home board and so he should leave both blots where they are. 8/4 allows a number of calamitous double hits and so by elimination we are left with 13/9 which creates another blot but at least duplicates White's 1's and 2's. Barring 11, 22 and 44 Red will only have one blot on the next time and a reasonable chance of survival.
The key thing here is to determine Red's plan before making your move.
1. Cubeful 2-ply 13/10 Eq.: -0.666 0.408 0.096 0.004 - 0.592 0.280 0.004 2. Cubeful 2-ply 21/20 13/11 Eq.: -0.819 (-0.153) 0.395 0.089 0.004 - 0.605 0.292 0.004 3. Cubeful 0-ply 21/18 Eq.: -0.905 (-0.239) 0.377 0.078 0.003 - 0.623 0.281 0.002 4. Cubeful 0-ply 21/20 8/6 Eq.: -0.925 (-0.259) 0.376 0.094 0.003 - 0.624 0.291 0.002 5. Cubeful 0-ply 6/3 Eq.: -0.943 (-0.277) 0.382 0.099 0.004 - 0.618 0.311 0.003


[ top ]
|
License README Repository and FTP access Groff dependencies Bug reports Mailing lists NEWS VERSION 1.22.3 NEWS VERSION 1.22.2 NEWS VERSION 1.22.1 NEWS VERSION 1.21 NEWS VERSION 1.20.1 NEWS VERSION 1.20 NEWS VERSION 1.19.2 NEWS VERSION 1.19.1 NEWS VERSION 1.19 NEWS VERSION 1.18.1 NEWS VERSION 1.18 |
Three mailing lists are available:
To subscribe, send a mail to 〈list〉-request@〈domain〉 (example<EMAIL_ADDRESS>for the ‘groff’ list) with the word ‘subscribe’ in either the subject or body of the e-mail (don’t include the quotes). Alternatively, you may subscribe by visiting the web pages at http://lists.gnu.org/mailman/listinfo/bug-groff
Each of these web pages also provides a link to a browseable archive of postings to the corresponding mailing list. |


WebFile Server Features
WebDAV
Document Version Control
Unstructured Information Management
External File Collaboration
Through the WebDAV protocol and documented Java APIs in Xythos WebFile Server, developers have a standard set of library services such as document version control, check-in/check-out, file and folder-level security, workflow, document classes, custom attributes and full-file logging to address the collaborative requirements of their applications. Other features include:
- Loosely-Coupled Distributed System: Xythos WebFile Server was designed to meet the most demanding performance requirements. Scalability is achieved through a loosely-coupled distributed system in which each component can scale independently. WebFile Server can operate with all of its components on one machine or the components can be deployed on separate machines. Installations with large numbers of users and data can be accommodated by increasing the number of each respective storage, database and application server component. WebFile Server performance has been optimized for HTTP and WebDAV so that it can efficiently support file access and storage over long distances.
- Flexible APIs: WebFile Server can be used to add unstructured information management and collaborative capabilities to any enterprise application. The WebFile Server APIs can be used to integrate Xythos' features into an application where application logic is coded directly on top of the WebFile Server. Developers can also easily limit which features their web application presents based on project and security requirements.
- Single File Instancing: If there is more than one copy of a file within the system, WebFile Server will not store more than one copy of that file on external storage. The document store architecture allows for single file instancing because multiple files in the database can point to the same file on disk. Single file instancing dramatically reduces storage requirements by eliminating duplicate data which is often estimated to be 30% of an organization's overall storage capacity.
- Global Schema: WebFile Server stores system-wide parameters in a database called the Xythos Global Schema. User and session information is also stored here. There is only one Xythos Global Schema per WebFile Server and it must be accessible to all machines running the WebFile Server code.
WebFile Server scales with the number of databases, files or users an organization has.


| DOSE: |
1.6 g |
oral |
Lecithin |
(daily) |
| |
repeated |
oral |
Piracetam |
(daily) |
I have experimented with many illegal drugs and herbal drugs. I am very sensitive to most drugs; I am the essence of lightweight. My 100 pound girlfriend can outdrink me. Despite my sensitivity to most drugs, I noticed absolutely nothing from piracetam.
The day my order came in I did an attack dose of 3200mg. Then proceeded with 800mg every 4 hours … taking a total of 5600mg that day. The next day I decided to increase my dose to 1600mg every four hours, taking a total of 6400mg per day. I did this for three weeks straight without noticing any effects. After two weeks with no success I decided to take 9600mg in the morning and 9600mg in the afternoon. I did that for a week with no results. I started taking lecithin many months before I discovered piracetam. I stuck with my regular lecithin schedule which contains 1.6 grams of phosphatidylcholine per day.
The setting was constantly changing over the course of a month. I am in college, I work in the accounting department, and I train my dog in agility courses daily. So I was doing things that are mentally demanding but these things did not seem any less demanding then usual. I read a couple of challenging philosophy books while on piracetam, but I did not feel my mind working any harder than usual to rearrange how I perceive reality. The only answer I could think of to explain why I did not feel anything and why others receive powerful effects is because my brain already communicates very well between hemispheres, and my brain already has an overactive acetylcholine system.
A final note, the stuff works great on my dog. I gave him 1600mg once in the morning for a week and I noticed that he had more mental energy than usual. He usually trains at full force for about 30 minutes straight, twice a day… that day he trained at full force for more than an hour during his first workout. I count his jumps, he usually does 350 jumps between two separate workouts on his hardest training day of the week. On that day he did 600 jumps. 400 the first workout, 200 the second.
On another day I do a training routine where he chases a bouncy ball around the basement with a strobe light on, to enhance his sensory perception. I noticed that while on piracetam, after about 5 minutes, he would fetch the ball almost as quickly as he would without the strobe light on. So maybe piracetam helps with timing skills. Retrieving a ball that you can only see half the time requires good timing skills.
Even though he has more mental energy while on piracetam, he does not seem agitated. He can still sleep at night and nap during the day. He is not startled by loud noises. He does not seem hyperactive or over stimulated at all, he just trains harder and faster. So the effects seem to be energizing but not like that of a typical stimulant.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Weight: |
(kg) |
||||
Height: |
(cm) |
||||
Age: |
Year |
||||
Your Gender? |
|
| Select an activity factor: | |
| Sedentary: little or no exercise | |
| Light: light exercise/sports 1-3 days per week | |
| Moderate: moderate exercise/sports 3-5 days per week | |
| Hard: hard exercise/sports 6-7 days per week | |
| Extra hard: extreme hard daily exercise/sports or job |
| Results: | ||
| The Body Mass Index (BMI) is: | ( kg/m2 ) | |
| Basal Metabolic Rate (BMR): | ( kcal/day ) | |
| BMR with activity factor: | ( kcal/day ) |


- sendMessage(String) - Method in class common.messages.MessageHandler
-
Method sends a TextMessage using this socket.
- sendReplica(MessageHandler, String, String) - Method in class replication.LazyReplication
-
update replicas
- sendReplica(MessageHandler, String, String) - Method in class replication.ReplicationManager
-
update replicas
- serialize() - Method in class common.messages.BrokerMessage
-
Serializes the data of the current TextMessage into a String with format
{StatusType: , key: , username: }
and returns the result in a new TextMessage
- serialize() - Method in class common.messages.CommonMessage
-
Serializes the data of the current TextMessage into a String with format
{StatusType: , key: , value: }
and returns the result in a new TextMessage
- serialize() - Method in class common.messages.EcsMessage
-
- ServerConnection - Class in app_kvEcs
-
- ServerConnection(Socket, int, String, Metadata, Logger) - Constructor for class app_kvEcs.ServerConnection
-
This class handles the connection to the server.
- ServerState - Class in app_kvServer
-
- ServerState() - Constructor for class app_kvServer.ServerState
-
- ServerState.State - Enum in app_kvServer
-
- setAddress(String) - Method in class common.messages.Broker
-
- setBroker(String, int) - Method in class common.messages.Metadata
-
- setCacheSize(int) - Method in class common.messages.EcsMessage
-
- setData(String) - Method in class common.messages.EcsMessage
-
- setDisplacementStrategy(String) - Method in class common.messages.EcsMessage
-
- setFrom(String) - Method in class common.messages.EcsMessage
-
- setIp(String) - Method in class common.messages.EcsMessage
-
- setKey(String) - Method in class common.messages.BrokerMessage
-
- setKey(String) - Method in class common.messages.CommonMessage
-
- setKey(String) - Method in class storage.KeyValue
-
- setMetadata(Metadata) - Method in class app_kvServer.KVServer
-
- setMetadata(Metadata) - Method in class common.messages.CommonMessage
-
- setMetadata(Metadata) - Method in class common.messages.EcsMessage
-
- setMsg(String) - Method in class common.messages.EcsMessage
-
- setMsgBytes(byte[]) - Method in class common.messages.EcsMessage
-
- setPort(int) - Method in class common.messages.Broker
-
- setPort(int) - Method in class common.messages.EcsMessage
-
- setRunning(boolean) - Method in class app_kvClient.KVClient
-
- setState(ServerState.State) - Method in class app_kvServer.ServerState
-
- setState(BrokerState.State) - Method in class notification.BrokerState
-
- setStatus(BrokerMessage.StatusType) - Method in class common.messages.BrokerMessage
-
- setStatusType(KVMessage.StatusType) - Method in class common.messages.CommonMessage
-
- setStatusType(EcsMessage.StatusType) - Method in class common.messages.EcsMessage
-
- setTo(String) - Method in class common.messages.EcsMessage
-
- setType(EcsMessage.StatusType) - Method in class common.messages.EcsMessage
-
- setUp() - Method in class testing.AdditionalTest
-
- setUp() - Method in class testing.InteractionTest
-
- setValue(String) - Method in class common.messages.BrokerMessage
-
- setValue(String) - Method in class common.messages.CommonMessage
-
- setValue(int, int) - Method in class reconciliation.VectorClock
-
- setValue(String) - Method in class storage.KeyValue
-
- setWriteLock() - Method in class app_kvEcs.ServerConnection
-
- shutDown() - Method in class app_kvEcs.KVEcs
-
Stops all server instances and exits the remote processes.
- shutDown() - Method in class app_kvEcs.ServerConnection
-
- shutDown() - Method in class app_kvServer.KVServer
-
Exits the KVServer application.
- size() - Method in class common.messages.Metadata
-
- start() - Method in class app_kvEcs.KVEcs
-
Starts the storage service by calling start() on all KVServer instances
that participate in the service.
- start() - Method in class app_kvServer.KVServer
-
Starts the KVServer, all client requests and all ECS requests are
processed.
- start - Static variable in class common.messages.Metadata
-
- start() - Method in class replication.ReplicationManager
-
- start3() - Method in class replication.ReplicationManager
-
- startEcs(int, int, int, String) - Method in class app_kvEcs.KVEcs
-
- startServer() - Method in class app_kvEcs.ServerConnection
-
- state - Static variable in class app_kvServer.KVServer
-
- state - Static variable in class notification.MessageBroker
-
- stop() - Method in class app_kvEcs.KVEcs
-
Stops the service; all participating KVServers are stopped for processing
client requests but the processes remain running.
- stop() - Method in class app_kvServer.KVServer
-
Stops the KVServer, all client requests are rejected and only ECS
requests are processed.
- stopRunning() - Method in class app_kvEcs.KVEcs
-
- stopServer() - Method in class app_kvEcs.ServerConnection
-
- storage - package storage
-
- Storage - Class in storage
-
- Storage() - Constructor for class storage.Storage
-
- StorageManager - Class in storage
-
- strategy - package strategy
-
- Strategy - Interface in strategy
-
Abstract class Strategy allows for any of the 3 actual strategies to be used.
- StrategyFactory - Class in strategy
-
- StrategyFactory() - Constructor for class strategy.StrategyFactory
-
- subscribe(String, String) - Method in class app_kvClient.KVClient
-
Creates a TextMessage that is then filled with required values for the
subscribe command and send to the responsible server.
- SubscriberData - Class in notification
-
This class handles the data that connects clients to their subscriptions.
- SubscriberData() - Constructor for class notification.SubscriberData
-
- suite() - Static method in class testing.AllTests
-


The underlying architecture of Habitat and XsA — Helix — is a set of principles and conventions focused on simplicity, flexibility, and extensibility.
Simplicity
Making the Sitecore solution manageable and simple - even as it grows and matures.
"Simplicity is consistency"
- everything is modules
- A module is a conceptual grouping of assets which relates to a business requirement.
- The conventions, processes and tools for managing all these assets is a module-centric – and thereby business centric – way.
- For example, when the company asks that their Sitecore solution contains website search, all assets, business logic and configuration relating to search belongs to the Search module.
- every module has one purpose (no "utilities" or "helpers")
- keep modules as seperate as possible (High Cohesion/Low Coupling)
- A module consists of all Types of Data —
- Code
- Configuration
- Templates
- Renderings
- Items
- The Reuse/Release Equivalency Principle (REP) - The granule of reuse is the granule of release
- The package must be created with reusable classes – “Either all of the classes inside the package are reusable, or none of them are”.
- The classes must also be of the same family.
- Classes that are unrelated to the purpose of the package should not be included.
- A package constructed as a family of reusable classes tends to be most useful and reusable.
- a module is self contained —
- The Common Reuse Principle (CRP) - Classes that play together, stay together
- Classes that tend to be reused together belong in the same package together. It is a way of helping us decide which classes belong in which package.
- We also want to keep in mind that when we depend on a package, we want to make sure that the classes are inseparable, and interdependent, which is also handy when culling classes that don’t belong.
- Tell us what belongs in a package.
- Cohesion is essential.
- If we fail this, the architecture is pointless - minimize the chance of a change affecting a module.
- make the modules as stable as possible —
- The Common Closure Principle (CCP) - Classes that change together, belong together
- The package should not have more than one reason to change.
- If change were to happen in an application dependent on a number of packages, ideally we only want changes to occur in one package, rather than in a number of them.
- This helps us determine classes that are likely to change and package them together for the same reasons.
- If the classes are tightly coupled, put them in the same package.
What does this mean to us?
- Domain modules must have semantic HTML
- Graphic Design and Visual Appearance belongs in the Project Layer
- Only include functionality that belongs in the module
Flexibility
Assuring the business that changes that additions can be made with smaller investments and without disruptions.
"Flexibility is productivity"
- for every change, we need to know what to test and what we are affecting
- the coupling of modules is essential - keep track of references!
- from loose to hard references (define Sitecore references in constants)
- Stable Abstractions Principle - the abstraction of a package should be in proportion to its stability
- The more abstract a module is, the more stable it is in the solution.
- Project specific page types and design are very concrete to a solution (highly volatile).
- Domain logic has concrete features (specific functionality) but should be abstract to the solution.
- Frameworks are abstract APIs (highly stable).
- Use Sitecore Template Inheritance to abstract data from page types.
- Stable Dependencies Principle - the further down in the layers the more abstract and stable the modules should be
- Depend in the direction of stability.
- Changes in lower level will affect more and requires a greater effort to test.
- For productivity, we need to be able to trust the architecture.
- Every dependency counts.
Source: https://laubplusco.net/the-groundbreaking-sitecore-habitat/
Extensibility
Providing a quick and manageable way of extending solutions and reusing features across sites and even across solutions
The conventions are based on a number of well-founded and industry-standard principles such as:
needs more work


Kaffeine uses a plugin style approach, with a core/standard stack (order is important)
This is an example taken from production code. It show most of Kaffeine's features:
Edge::add = (nick, name, complete, opts={}) { @client.select 15 user = User.find! {id: nick} puzzle = Puzzle.find! {name: name} err = client.set! "#{user}:#{puzzle}" if !err, complete() }
Allows function calls with callbacks to be unwrapped via a ! postfix. E.g:
fish = $.get!('/fish') $("stomach").append(fish) ok = stomach.save!() meal.complete = ok
This is super useful for simplifying nested asynchronous calls (esp with nodejs)
Provide the @ alias for 'this'. E.g:
@legs = legs @color = color
In the case of an unwrapped function, @ will be rewritten to refer to the original this, for convenience. Use this
to refer to the actual this
Fish.prototype.eat = { @food = getFood!() @stomach.ingest! @food poop = @stomach.digest! @food this.next(poop) }
provides support for omitting the var keyword: the variables will be automagically defined in the closest relevant closure. E.g.
x = null { x = 1 y = 2 }
Provide optional brackets for function calls. E.g.
remove eggs.shell mix eggs, milk.off ? milk : null outer inner innermost
keywords such as "for", or "if" can omit their brackets (as long as the statement doesn't become amiguous). The brackets are inserted either before a newline, a left brace '{' or a comma (for one liners)
for i in A run A[i] if name == "john", return false while we_have_time() { run tasks }
Allows for multiline strings:
var html = "
SOY SAUCE
  "
Maintains new lines --- but can be suppressed with the \ character (which provides parity with normal javascript):
var html = "\ \
SOY SAUCE
\ \ "
Allows an 'of' operator for looping through arrays:
for(x of [7,3,4]) sum += x
An optional second parameter will refer to the key:
for(x, i of [7,3,4]) sum += i
Also allows an optional second parameter for the in
keyword:
for(key, val in A) zip += "#key:#val"
provides ruby style string interpolation via #{}
letter = "Dear #{name}, I am writing to you to inform you of #{purpose} Kind Regards #{sender} "
the last statement of a function will be automagically returned. E.g.
getName = { @name }
This will only work for variables, objects and functions. I.e. an final if statement will result no return value
provides the # shortcut for referring to the first argument in a function. Additionally, #n refers to the nth argument (n >= 0). Useful for terse function definitions, e.g:
square = { #*# } times = { #*#1 }
the function keyword can be optionally omitted, along with empty argument lists.
ok = (timeout) { sendNote() setTimeout { run() }, timeout return true }
Note {} could be a function or an object, so to avoid ambiguity, it's defined to be an object. To express an empty function, use one of the following forms:
{;} {null} function() { }
Provides an alternative calling method than can be used for easily chaining (UNIX style passing).
result = input | fn args
Chaining input to output:
result = input | fn a, b | fn2 c | fn3 d
For example, it is very useful for ruby style enumeration chaining without using prototypes, and other utilities
| = require "pipe_utils" People | map { #.name } | detect { #.length > 3 } opts = opts | extend default 5 | times { if(!send()) return false } names | asyncMap (name, fn) { user = User.find! {name: name} fn(user) }, complete
2 extra assignment operators, ||=
and .=
location.href .= replace("?old", "?new") name .= toUpperCase() opts ||= {}
Also an extend operator <-
a <- b options = options <- { size: "small", num: 10}
Allows defaults for null or undefined arguments. Nb - uses non strict comparison with null
(x=1, r=[], a=3) { x + 4 }
npm install kaffeine


PDM
Home
Model
Tool
About
CaringBridge
Communication Type
Communication 1
Max 1
Min 1
Communication 2
Max 2
Min 2
Communication 3
Max 3
Min 3


MICHAEL A film review by Andrew Hicks Copyright 1997 Andrew Hicks / Fatboy Productions
(1996) ** (out of four)
Hopefully, MICHAEL will be the last nail in the angel- obsession coffin. In the last couple years we've been overrun with the angel theme in the media. "Touched By an Angel," THE PREACHER'S WIFE, there was even a TV special where incidences of angels helping people in dangerous situations were re-enacted by bad actors. I'm still wondering why they didn't just get William Shatner to do voiceovers and call it "Rescue 777."
The religious folk have been talking about how wonderful this angel revival is, apparently realizing that there's almost zero correlation between movie angels and Biblical angels. Nowhere is this polarization more concrete than in Nora Ephron's MICHAEL, in which the title character, who the Bible says threw Satan out of heaven, smokes, drinks, eats like a pig and beds down with multiple women. This kind of behavior isn't justified in any Bible not written by Anton LeVay, but I guess John Travolta doesn't care because it's not his religion to begin with. If he had to play a boozing, promiscuous L. Ron Hubbard, he'd probably feel differently.
Travolta, of course, plays Michael, a slovenly New Age angel who quotes not John and Paul, the disciples, but John and Paul, the Beatles, with a love-is-all-you-need message. His mission on Earth involves match-making tabloid writers William Hurt and Andie MacDowell, who get a letter from an old women in Iowa (Jean "Edith Bunker" Stapleton) claiming she has an angel living in her house. Hurt, MacDowell, Robert Pastorelli and his cute dog cross several states to get the story, which they figure will probably win them the tabloid equivalent of the Pulitzer Prize.
Michael's first appearance in the movie sets the tone for everything that follows.  Cigarette in mouth, he scratches himself, grabs a beer from the refrigerator and heads back upstairs. Travolta said in one of his myriad television interviews promoting MICHAEL that people who don't buy the entrance probably won't buy the rest of the movie. He was right; I didn't buy either.
It's not just the fact that this is one of God's right-hand men having premarital sex with Teri Garr, it's also never clear why Michael would think the way he does. These movie angels live in a perfect heaven with the Creator of the universe Himself, but their main goal throughout eternity is to find ways to get back to Earth. With Denzel Washington's character in THE PREACHER'S WIFE, it made more sense because he was once a human. Michael's an archangel, though; he's never lived down here and therefore would have no reason to continually want to leave heaven to experience the pleasures of a flawed earth.
One more thing I didn't buy -- this movie assumes the Bible is true. Michael says he wrote Psalm 85 and when Stapleton quotes from Revelation, he verifies it. But is this the same Bible that makes it perfectly clear that God hates sin? Fornication, drunkenness, gluttony, those are pillar sins. That God would let this winged angel come down from heaven every hundred years or so to do this stuff doesn't seem plausible.
We're probably not supposed to think about the movie's theology, though. We're just supposed to sit back and let MICHAEL entertain us. Unfortunately, everything about the movie is just as muddled as its characterization of angels. The plot is thin and predictable. The tabloid writers drive Michael back to Chicago and, along the way, he does all sorts of human things and helps Hurt and MacDowell fall in love. There aren't very many laughs and the drama is forced and laughable.
Travolta and everyone else do a decent job acting, but the fault here lies in the script. This movie was probably sold to the studio on the basis of, "Hey, we've got John Travolta as an angel in a romantic comedy that's going to open on Christmas Day." None of the executives had to read the script to realize the very concept would make money, but they should have realized Ephron's mix of dark themes and storybook romance would make for a bizarre combination. MICHAEL could have used a little divine intervention.
--
Visit the Movie Critic at LARGE homepage at http://www.missouri.edu/~c667778/movies.html
Serving America For Over 1/33rd of a Century!
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


ASCII text encoding
Activation
Activation best practices
Activation privacy
Backing up your license
Binary representation
Decimal representation
Digit errors
Does Hextrapolate use BOMs?
Downloading Hextrapolate
Finding out where Hextrapolate is installed
Force Quitting Hextrapolate
Hexadecimal representation
How does product activation work?
How many times may I activate?
How to file a good bug report
How to submit a feature request
Installing Hextrapolate
Obtaining a System Profiler report
Octal representation
Purchasing Hextrapolate
Quitting Hextrapolate
Registering Hextrapolate
Reporting bugs
Requesting support
Resetting the preferences
Resetting your activation limit
Sending feedback
Text encoding errors
Transferring your license to another machine
Troubleshooting tips
UTF-16 text encoding
UTF-8 text encoding
Uninstalling Hextrapolate
Unregistering Hextrapolate
What happens if Wincent stops trading?
What happens if the network is down when I try to activate?
What to do if you haven't received your license
What to do if you lose your license code
Why are the text fields blank?
Why are there garbage characters in the text fields?
Why doesn't Hextrapolate let me type the characters I want?
Why use product activation?


|
mlpack
1.0.12
|
A density estimation tree is similar to both a decision tree and a space partitioning tree (like a kd-tree). More...
Public Member Functions | |
| DTree () | |
| Create an empty density estimation tree. More... | |
| DTree (const arma::vec &maxVals, const arma::vec &minVals, const size_t totalPoints) | |
| Create a density estimation tree with the given bounds and the given number of total points. More... | |
| DTree (arma::mat &data) | |
| Create a density estimation tree on the given data. More... | |
| DTree (const arma::vec &maxVals, const arma::vec &minVals, const size_t start, const size_t end, const double logNegError) | |
| Create a child node of a density estimation tree given the bounding box specified by maxVals and minVals, using the size given in start and end and the specified error. More... | |
| DTree (const arma::vec &maxVals, const arma::vec &minVals, const size_t totalPoints, const size_t start, const size_t end) | |
| Create a child node of a density estimation tree given the bounding box specified by maxVals and minVals, using the size given in start and end, and calculating the error with the total number of points given. More... | |
| ~DTree () | |
| Clean up memory allocated by the tree. More... | |
| double | AlphaUpper () const |
| Return the upper part of the alpha sum. More... | |
| double | ComputeValue (const arma::vec &query) const |
| Compute the logarithm of the density estimate of a given query point. More... | |
| void | ComputeVariableImportance (arma::vec &importances) const |
| Compute the variable importance of each dimension in the learned tree. More... | |
| size_t | End () const |
| Return the first index of a point not contained in this node. More... | |
| int | FindBucket (const arma::vec &query) const |
| Return the tag of the leaf containing the query. More... | |
| double | Grow (arma::mat &data, arma::Col< size_t > &oldFromNew, const bool useVolReg=false, const size_t maxLeafSize=10, const size_t minLeafSize=5) |
| Greedily expand the tree. More... | |
| DTree * | Left () const |
| Return the left child. More... | |
| double | LogNegativeError (const size_t totalPoints) const |
| Compute the log-negative-error for this point, given the total number of points in the dataset. More... | |
| double | LogNegError () const |
| Return the log negative error of this node. More... | |
| double | LogVolume () const |
| Return the inverse of the volume of this node. More... | |
| const arma::vec & | MaxVals () const |
| Return the maximum values. More... | |
| arma::vec & | MaxVals () |
| Modify the maximum values. More... | |
| const arma::vec & | MinVals () const |
| Return the minimum values. More... | |
| arma::vec & | MinVals () |
| Modify the minimum values. More... | |
| double | PruneAndUpdate (const double oldAlpha, const size_t points, const bool useVolReg=false) |
| Perform alpha pruning on a tree. More... | |
| double | Ratio () const |
| Return the ratio of points in this node to the points in the whole dataset. More... | |
| DTree * | Right () const |
| Return the right child. More... | |
| bool | Root () const |
| Return whether or not this is the root of the tree. More... | |
| size_t | SplitDim () const |
| Return the split dimension of this node. More... | |
| double | SplitValue () const |
| Return the split value of this node. More... | |
| size_t | Start () const |
| Return the starting index of points contained in this node. More... | |
| size_t | SubtreeLeaves () const |
| Return the number of leaves which are descendants of this node. More... | |
| double | SubtreeLeavesLogNegError () const |
| Return the log negative error of all descendants of this node. More... | |
| int | TagTree (const int tag=0) |
| Index the buckets for possible usage later; this results in every leaf in the tree having a specific tag (accessible with BucketTag()). More... | |
| std::string | ToString () const |
| Returns a string representation of this object. More... | |
| bool | WithinRange (const arma::vec &query) const |
| Return whether a query point is within the range of this node. More... | |
| void | WriteTree (FILE *fp, const size_t level=0) const |
| Print the tree in a depth-first manner (this function is called recursively). More... | |
Private Member Functions | |
| bool | FindSplit (const arma::mat &data, size_t &splitDim, double &splitValue, double &leftError, double &rightError, const size_t minLeafSize=5) const |
| Find the dimension to split on. More... | |
| size_t | SplitData (arma::mat &data, const size_t splitDim, const double splitValue, arma::Col< size_t > &oldFromNew) const |
| Split the data, returning the number of points left of the split. More... | |
Private Attributes | |
| double | alphaUpper |
| Upper part of alpha sum; used for pruning. More... | |
| int | bucketTag |
| The tag for the leaf, used for hashing points. More... | |
| size_t | end |
| The index of the last point in the dataset contained in this node (and its children). More... | |
| DTree * | left |
| The left child. More... | |
| double | logNegError |
| log-negative-L2-error of the node. More... | |
| double | logVolume |
| The logarithm of the volume of the node. More... | |
| arma::vec | maxVals |
| Upper half of bounding box for this node. More... | |
| arma::vec | minVals |
| Lower half of bounding box for this node. More... | |
| double | ratio |
| Ratio of the number of points in the node to the total number of points. More... | |
| DTree * | right |
| The right child. More... | |
| bool | root |
| If true, this node is the root of the tree. More... | |
| size_t | splitDim |
| The splitting dimension for this node. More... | |
| double | splitValue |
| The split value on the splitting dimension for this node. More... | |
| size_t | start |
| The index of the first point in the dataset contained in this node (and its children). More... | |
| size_t | subtreeLeaves |
| Number of leaves of the subtree. More... | |
| double | subtreeLeavesLogNegError |
| Sum of the error of the leaves of the subtree. More... | |
A density estimation tree is similar to both a decision tree and a space partitioning tree (like a kd-tree).
Each leaf represents a constant-density hyper-rectangle. The tree is constructed in such a way as to minimize the integrated square error between the probability distribution of the tree and the observed probability distribution of the data. Because the tree is similar to a decision tree, the density estimation tree can provide very fast density estimates for a given point.
For more information, see the following paper:
| mlpack::det::DTree::DTree | ( | ) |
Create an empty density estimation tree.
| mlpack::det::DTree::DTree | ( | const arma::vec & | maxVals, |
| const arma::vec & | minVals, | ||
| const size_t | totalPoints | ||
| ) |
Create a density estimation tree with the given bounds and the given number of total points.
Children will not be created.
| maxVals | Maximum values of the bounding box. |
| minVals | Minimum values of the bounding box. |
| totalPoints | Total number of points in the dataset. |
| mlpack::det::DTree::DTree | ( | arma::mat & | data | ) |
Create a density estimation tree on the given data.
Children will be created following the procedure outlined in the paper. The data will be modified; it will be reordered similar to the way BinarySpaceTree modifies datasets.
| data | Dataset to build tree on. |
| mlpack::det::DTree::DTree | ( | const arma::vec & | maxVals, |
| const arma::vec & | minVals, | ||
| const size_t | start, | ||
| const size_t | end, | ||
| const double | logNegError | ||
| ) |
Create a child node of a density estimation tree given the bounding box specified by maxVals and minVals, using the size given in start and end and the specified error.
Children of this node will not be created recursively.
| maxVals | Upper bound of bounding box. |
| minVals | Lower bound of bounding box. |
| start | Start of points represented by this node in the data matrix. |
| end | End of points represented by this node in the data matrix. |
| error | log-negative error of this node. |
| mlpack::det::DTree::DTree | ( | const arma::vec & | maxVals, |
| const arma::vec & | minVals, | ||
| const size_t | totalPoints, | ||
| const size_t | start, | ||
| const size_t | end | ||
| ) |
Create a child node of a density estimation tree given the bounding box specified by maxVals and minVals, using the size given in start and end, and calculating the error with the total number of points given.
Children of this node will not be created recursively.
| maxVals | Upper bound of bounding box. |
| minVals | Lower bound of bounding box. |
| start | Start of points represented by this node in the data matrix. |
| end | End of points represented by this node in the data matrix. |
| mlpack::det::DTree::~DTree | ( | ) |
Clean up memory allocated by the tree.
|
inline |
Return the upper part of the alpha sum.
Definition at line 276 of file dtree.hpp.
References alphaUpper.
| double mlpack::det::DTree::ComputeValue | ( | const arma::vec & | query | ) | const |
Compute the logarithm of the density estimate of a given query point.
| query | Point to estimate density of. |
| void mlpack::det::DTree::ComputeVariableImportance | ( | arma::vec & | importances | ) | const |
Compute the variable importance of each dimension in the learned tree.
| importances | Vector to store the calculated importances in. |
|
inline |
| int mlpack::det::DTree::FindBucket | ( | const arma::vec & | query | ) | const |
Return the tag of the leaf containing the query.
This is useful for generating class memberships.
| query | Query to search for. |
|
private |
Find the dimension to split on.
| double mlpack::det::DTree::Grow | ( | arma::mat & | data, |
| arma::Col< size_t > & | oldFromNew, | ||
| const bool | useVolReg = false , |
||
| const size_t | maxLeafSize = 10 , |
||
| const size_t | minLeafSize = 5 |
||
| ) |
Greedily expand the tree.
The points in the dataset will be reordered during tree growth.
| data | Dataset to build tree on. |
| oldFromNew | Mappings from old points to new points. |
| useVolReg | If true, volume regularization is used. |
| maxLeafSize | Maximum size of a leaf. |
| minLeafSize | Minimum size of a leaf. |
|
inline |
| double mlpack::det::DTree::LogNegativeError | ( | const size_t | totalPoints | ) | const |
Compute the log-negative-error for this point, given the total number of points in the dataset.
| totalPoints | Total number of points in the dataset. |
|
inline |
Return the log negative error of this node.
Definition at line 259 of file dtree.hpp.
References logNegError.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
| double mlpack::det::DTree::PruneAndUpdate | ( | const double | oldAlpha, |
| const size_t | points, | ||
| const bool | useVolReg = false |
||
| ) |
Perform alpha pruning on a tree.
Returns the new value of alpha.
| oldAlpha | Old value of alpha. |
| points | Total number of points in dataset. |
| useVolReg | If true, volume regularization is used. |
|
inline |
|
inline |
|
inline |
|
private |
Split the data, returning the number of points left of the split.
|
inline |
|
inline |
Return the split value of this node.
Definition at line 257 of file dtree.hpp.
References splitValue.
|
inline |
|
inline |
Return the number of leaves which are descendants of this node.
Definition at line 263 of file dtree.hpp.
References subtreeLeaves.
|
inline |
Return the log negative error of all descendants of this node.
Definition at line 261 of file dtree.hpp.
References subtreeLeavesLogNegError.
| int mlpack::det::DTree::TagTree | ( | const int | tag = 0 | ) |
Index the buckets for possible usage later; this results in every leaf in the tree having a specific tag (accessible with BucketTag()).
This function calls itself recursively.
| tag | Tag for the next leaf; leave at 0 for the initial call. |
| std::string mlpack::det::DTree::ToString | ( | ) | const |
Returns a string representation of this object.
| bool mlpack::det::DTree::WithinRange | ( | const arma::vec & | query | ) | const |
Return whether a query point is within the range of this node.
| void mlpack::det::DTree::WriteTree | ( | FILE * | fp, |
| const size_t | level = 0 |
||
| ) | const |
Print the tree in a depth-first manner (this function is called recursively).
| fp | File to write the tree to. |
| level | Level of the tree (should start at 0). |
|
private |
Upper part of alpha sum; used for pruning.
Definition at line 242 of file dtree.hpp.
Referenced by AlphaUpper().
|
private |
|
private |
|
private |
|
private |
log-negative-L2-error of the node.
Definition at line 221 of file dtree.hpp.
Referenced by LogNegError().
|
private |
The logarithm of the volume of the node.
Definition at line 236 of file dtree.hpp.
Referenced by LogVolume().
|
private |
|
private |
|
private |
|
private |
|
private |
|
private |
The splitting dimension for this node.
Definition at line 215 of file dtree.hpp.
Referenced by SplitDim().
|
private |
The split value on the splitting dimension for this node.
Definition at line 218 of file dtree.hpp.
Referenced by SplitValue().
|
private |
|
private |
Number of leaves of the subtree.
Definition at line 227 of file dtree.hpp.
Referenced by SubtreeLeaves().
|
private |
Sum of the error of the leaves of the subtree.
Definition at line 224 of file dtree.hpp.
Referenced by SubtreeLeavesLogNegError().


|
|
|
|
|
|
|
(New users may need to verify their email address)
|
|
If you do not see or cannot click / tap the Click to Read Message
button:
|
Desktop Users:
|
Forward your original message and its attachment to<EMAIL_ADDRESS>and check your inbox for a link to view it.
|
Mobile Users:
|
You can now use the SecureMail mobile
application to read and reply to email on your personal device.
|
|
Need Help?
|
|
|
|
Your personalized image for:
<EMAIL_ADDRESS>|
|
This personal security image will appear
on secure email to you. If it's missing
or unrecognized, please contact customer
support. Learn
more
|
|
|
|
|
Email Security Powered by Voltage IBE(tm)
Copyright 2002-2017 JPMorgan Chase & Co. All rights reserved.
|
|


Click on the desired image to view the example in a new tab
Please use only Chrome (preferred) or Firefox to view the examples
Use clear option from UI to clear the local storage


CARPOOL A film review by Chuck Dowling Copyright 1996 Chuck Dowling
(1996) *1/2 - C:Tom Arnold, David Paymer, Rod Steiger, Rhea Perlman.
Keep in mind that this film is directed by Arthur Hiller, the man who is the president of the Motion Picture Academy. The man who theoretically should have seen every good movie made since his term of office began. The man who directed the hilarious Alan Arkin/Peter Falk comedy "The In-Laws" and also such acclaimed films as "Love Story" and "The Hospital". Keep in mind that the film's producer, Arnon Milchan, has produced some of the best films in the last fifteen years, such as "The King of Comedy", "JFK", and "Falling Down". With such experience, these men know exactly what makes a movie great. Which is why it's so shocking that "Carpool" is a truly horrible mess.
The plot is extremely simple. As a matter of fact, the plot is beyond simple. Tom Arnold robs a gourmet pastry shop, kidnaps David Paymer and takes his minvan, only to discover that Paymer was driving the neighborhood kids to school. And for the rest of the film they have to not get caught by the Seattle police, who are portrayed as the most inept police force on the planet.
What's so troublesome about the film is that it's "PG". It's meant to be a kids film. But there are things in this film that are completely inappropriate for kids.   Good message for the children. And the worst thing about the film, regardless of what kinds of jokes there are, they just aren't funny, no matter how old you are. The crowd in the theater when I saw the film laughed once, and that was when a kid stuck a gummi bear up his nose. Comedy gold to little kids you know. There were one or two lines in the film which I found humorous, but certainly not enough to carry the entire film.
There's one ridiculous thing about a scene in the film I'd like to comment on (there are many actually, but I just don't have that kind of time to comment on all of them). At one point the "good guys" are at a carnival, fleeing from the bad guys. One of the kids is riding a ferris wheel and someone bumps a lever and the ferris wheel starts to spin dangerously fast. And of course they have to save the kid. Now, why would an amusement park ride have a setting on it which would never be used and is certain to cause death? Just a thought.
Now I need to justify why I saw this film. The ONLY reason I watched it was because my favorite actor, Rod Steiger, was in it. Arthur Hiller was smart enough to get an actor he's worked with in the past (1976's "W.C. Fields and Me") and then not smart enough to give him anything to do. He's in the last five minutes of the film and he does a good job as always with what he's given, but it's just not enough. And Hiller should be beaten for actually putting Steiger in a clown outfit at the end and having him sell doughnuts at a carnival. Booooooooooo Mr. Hiller.
At one point in the film, David Paymer says to someone "This isn't funny". Mr. Paymer, you're exactly right.
-- Chuck Dowling Visit Chuck's Movie Reviews at http://users.southeast.net/~chuckd21/ Over 1,500 movies rated and/or reviewed! Movie news, box office reports, film related links, and reader's polls and reviews.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


The GPS world is full of shoddy, poorly-documented designs. All
too many devices have behaviors that drive the harried maintainers of
gpsd
to shake their heads and mutter What were they
thinking?
This page goes beyond the merely ordinary and commemorates the really special blunders — bugs and design errors so consummately brain-dead that the only possible responses are either rage or helpless laughter.
By naming and shaming the vendors who perpetrated these egregious blunders, we hope to exert some pressure for higher quality standards in the future.
Your contributions are welcome. If you're describing a firmware bug, it's best if you can identify the firmware version or range of versions it applies to.
These are the screwups that lead us to wonder if the GPS chipset vendors ever read the NMEA documentation.
When Qualcomm bought SiRF, they stopped releasing any documentation, and started get creative with their interpretations of NMEA. Thenm starting adding new protocols.
The QUalcomm SiRF-TriG, Furuno GT-88, Navlor CH-4701, and Quectel EG25-G, all emit broken $xxGSA sentences. Each broken in different ways.
The Quectel-chipsets implement "Querky" interpretations of the NMEA protocol. *gpsd* tries to implement workarounds when possiblem but it would be far better is Quectel developers read the NMEA protocol documentation.
These are the screwups that lead us to wonder if the GPS chipset vendors ever actually test their hardware.
The iTalk protocol from Fastrax Inc. sometimes emits well-formed, checksummed binary packets in which the length is incorrect. If you trust it and read the number of bytes it tells you to, you'll land in the middle of the next packet.
Wintec has modified the firmware on the WBT200 (and probably the WBT100 as well) to disable iTalk support, thus making more room in the flash memory for logging. This wouldn't be a problem if they had also disabled the protocol switch command. Users attempting to switch their Wintec receivers to iTalk will find their receiver is left in limbo; not emitting iTalk, and unable to switch back to NMEA either. A hard reset by removing all power sources (including onboard battery backup) is the only way to get the receiver to communicate again.
Some Garmin chips issue a bogus length field, too. This from the outfit that likes to tout itself as the industry leader!
The SiRF-IV chipset has a tendency to freeze when switched from binary to NMEA mode (powering it off unjams it). This is some kind of race condition in the firmware that cannot be fixed by waiting on command ACKs; we have tried that.
The best evidence that the GPS industry is run by morons is the quality (or, rather, utter lack of quality) of their chipset documentation. You would think they'd have figured out by now that good and readily available documentation, making it easy for others to interface to their hardware, will sell more hardware. But no; most vendors make documentation difficult to get, and it tends to be both incomplete and vague when you get it. A few vendors go above and beyond the normal stupidity...
Some versions of the SiRF protocol manual, including 1.4, describe the data widths in the time portion of the Geodetic Navigation Information packet incorrectly. If you trust them, you will extract garbage from good packets.
Qualcomm makes no documentation available on the Sirfstar V GNSS.
The Garmin GPS chipset issues a number of important messages that Garmin has explicitly refused to document.
GPS chipset vendors love their proprietary binary protocols. There
is some excuse for this, given that the industry standard
NMEA
0183 grew by a series of kluges and accretions and would probably have
turned out better if it had been designed by chimpanzees on crack
— but you'd think the vendors would at least make sure that
their binary protocols are a functional superset of NMEA. But no; in
the laugh-one-minute, puke-the-next world of GPS chipsets, it ain't
so...
SiRF binary mode delivers HDOP but not PDOP or VDOP. SiRFs in NMEA mode deliver all three.
EverMore NMEA delivers UTC time. EverMore binary protocol delivers only GPS time, which has a time-varying offset from UTC — and no way to query the offset.


It seems like you forgot your password for your CMS account, click below to reset your password.
If you did not forgot your password you can safely ignore this email.


Building web applications with AngularJS and Grails is super fast and enjoyable
Beign able to develop mobile applications, native or hibrid, it's really fun, but watching how people use them it's the greatest part
Learning it's one of my passions. I'm always eager to learn new frameworks, libraries, languages and try them in some projects.


Package algorithms.dimensionReduction
Class CURDecomposition
- java.lang.Object
-
- algorithms.dimensionReduction.CURDecomposition
-
public class CURDecomposition extends java.lang.Object
a CUR-Decomposition is an approximation to the SVD, but the result is that all large matrices of the decomposition are sparse in contrast to the same in SVD. This class implements CUR-decomposition following the book "Mining of Massive Datasets" by Jure Leskovec, Anand Rajaraman, Jeff Ullman. http://www.mmds.org/ "CUR matrix decompositions for improved data analysis" Runtime is O(m*n) Drineas et al. 2008 (https://www.pnas.org/content/pnas/106/3/697.full.pdf) "CUR decompositions are low-rank matrix decompositions that are explicitly expressed in terms of a small number of actual columns and/or actual rows of the data matrix... We present an algorithm that preferentially chooses columns and rows that exhibit high “statistical leverage” and, thus, in a very precise statistical sense, exert a disproportionately large “influence” on the best low-rank fit of the data matrix. By selecting columns and rows in this manner, we obtain improved relative-error and constant-factor approximation guarantees in worst-case analysis, as opposed to the much coarser additive-error guarantees of prior work. In addition, since the construction involves computing quantities with a natural and widely studied statistical interpretation, we can leverage ideas from diagnostic regression analysis to employ these matrix decompositions for exploratory data analysis." NOTE: consider also implementing in future: http://www.cs.cmu.edu/~christos/PUBLICATIONS/sdm07-lsm.pdf "Less is More: Compact Matrix Decomposition for Large Sparse Graphs" 2007, Sun, Xie, Zhang, and Faloutsos Proceedings of the 2007 SIAM International Conference on Data Mining ...the Compact Matrix Decomposition (CMD), to compute sparse low rank approximations. CMD dramatically reduces both the computation cost and the space requirements over existing decomposition methods (SVD, CUR). Using CMD as the key building block, we further propose procedures to efficiently construct and analyze dynamic graphs from real-time application data. ... Also, kernel PCA, nonmetric multidimensional scaling (NMDS), and a fast version of isomap.- Author:
- nichole
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static class
CURDecomposition.CDFs
static class
CURDecomposition.CUR
static class
CURDecomposition.PDFs
static class
CURDecomposition.SelectedFromA
-
Constructor Summary
Constructors Constructor Description CURDecomposition()
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description (package private) static CURDecomposition.CDFs
_calculateCDFs(double[][] a, int k)
(package private) static CURDecomposition.PDFs
_calculatePDFs(double[][] a)
calculate the col and row Frobenius norm discrete probabilities from a (a.k.a.(package private) static CURDecomposition.SelectedFromA
_calculateR(double[][] a, int[] selectedRowIdxs, double[] rowPDF)
calculate R: R is an k x n matrix composed of a randomly chosen set of k rows of M.(package private) static double[][]
_calculateU(double[][] a, int[] selectedRIdxs, int[] selectedCIdxs)
static CURDecomposition.CUR
calculateDecomposition(double[][] a, int k)
a CUR-Decomposition is an approximation to the SVD, but the result is that all large matrices of the decomposition are sparse in contrast to the same in SVD.
-
-
-
Method Detail
-
calculateDecomposition
public static CURDecomposition.CUR calculateDecomposition(double[][] a, int k) throws no.uib.cipr.matrix.NotConvergedException
a CUR-Decomposition is an approximation to the SVD, but the result is that all large matrices of the decomposition are sparse in contrast to the same in SVD. Runtime is O(m*n) Drineas et al. NOTE: Let C = CUR decomposition(A). The eigenvectors of C are equal to the eigenvectors of A and both are equal to the eigenvectors C^T*C and A^T*A. Let lambda_CC = eigenvalues of C^T*C. The determinant( C^T*C - lambda * I) = 0. The trace of (C^T*C) = trace(lambda * I). NOTE: could improve the speed and space used for very large matrices by using FlexCompColMatrix and FlexCompRowMatrix for C, U, R, and result matrices. Also, for very large matrices, consider implementing in CDFRandomSelect.java the integer transformation and storage in YFastTrie.- Parameters:
a
- is an mxn matrix.k
- the rank to approximate- Returns:
- the cur decomposition C, U, and R. c plays the role of svd's U and R plays he rol of SVD's v^T.
- Throws:
no.uib.cipr.matrix.NotConvergedException
- thrown if the MTJ SVD method cannot converge for a matrix.
-
_calculateCDFs
static CURDecomposition.CDFs _calculateCDFs(double[][] a, int k)
-
_calculatePDFs
static CURDecomposition.PDFs _calculatePDFs(double[][] a)
calculate the col and row Frobenius norm discrete probabilities from a (a.k.a. calculating Marginal probability mass function of the contingency table). runtime is O(N) where N = mxn. NOTE: the Frobenius norm is the square root of the sum of the squares of all elements of a matrix (2.2-4 of Golub and van Loan).- Parameters:
a
- an mxn matrix.- Returns:
- the column and row PDFs of matrix a where a row PDF is the Frobenius norm of the column divided by the Frobenius norm of the matrix, and the row PDF is similar but calculated for rows instead of columns.
-
_calculateR
static CURDecomposition.SelectedFromA _calculateR(double[][] a, int[] selectedRowIdxs, double[] rowPDF)
calculate R: R is an k x n matrix composed of a randomly chosen set of k rows of M. each row of R gets normalized by sqrt( k * rowPDF_{selected_row}). if a row of A is present more than once in the selection, it is included only the first time and that included column is then multiplied by the square root of the number of duplicates.- Parameters:
a
- the m x n matrix, of m samples of n variates or parameters.selectedRowIdxs
- a vector of indexes of rows of matrix a, which have been randomly selected from the row marginal probabilities.rowPDF
- the row marginal probabilities.- Returns:
- matrix of selected rows from A normalized and an array of the unique selected indexes (corrections for duplicated indexes are performed in this method).
-
_calculateU
static double[][] _calculateU(double[][] a, int[] selectedRIdxs, int[] selectedCIdxs) throws no.uib.cipr.matrix.NotConvergedException
- Throws:
no.uib.cipr.matrix.NotConvergedException
-
-


{% extends "domestic/base.html" %} {% load breadcrumbs from component_tags %} {% load static %} {% block head_css %} {{ block.super }} {% endblock %} {% block head_title %} E-commerce advice{{block.super}} {% endblock %} {% block body_js %} {{ block.super }} {% endblock %} {% block content %} {% breadcrumbs 'Local export support form' %} great.gov.uk {% endbreadcrumbs %} {% csrf_token %} Your details {% include 'core/includes/form_field.html' with field=form.first_name %} {% include 'core/includes/form_field.html' with field=form.last_name %} {% include 'core/includes/form_field.html' with field=form.email %} {% include 'core/includes/form_field.html' with field=form.phone_number %} {% include 'core/includes/form_field.html' with field=form.job_title %} About your business {% include 'core/includes/form_field.html' with field=form.company_name %} {% include 'core/includes/form_field.html' with field=form.company_postcode %} {% include 'core/includes/form_field.html' with field=form.annual_turnover %} {% include 'core/includes/form_field.html' with field=form.employees_number %} {% include 'core/includes/form_field.html' with field=form.currently_export %} Get Business Support {% include 'core/includes/form_field.html' with field=form.comment %} {% include 'core/includes/form_field.html' with field=form.terms_agreed %} {% include 'core/includes/form_field.html' with field=form.captcha %} Submit {% endblock %}


to have the jet worldwide leaderboard based off kills for all the different jets implemented in battlelog like you all do for the worldwide rankings for weapons and jets based off kills here at bf3stats.com thanks and i love what you guys are doing for us couldn't have been any better i love this site and i view this site hundreds of times a day but if i had an idea it would definitely be this me and many others want to see are some of the best with certain jets ^_^
BrainFooLong
Administrator
I think the best place for any ranking is bf3stats.com.
And if you have any ideas about it, contact bf3stats.


Cuba Admin Design makes your project modern, clean and reduce your project integration time. cuba comes with 10+ Apps , Dark Mode and RTL Ready
Admin Unique Layouts
Top Frameworks
Frameworks
Dashboard
So many unique cards
Usefull application
Usefull Templates
Components


{{ site.github_username }}
You will find all my repos published on github.
Visit my Page to stay up-to-date!
Visit my Twitter Proflile.
Visit my Youtube profil & view my recent videos!


Pandit Dwarka Prasad Mishra Indian Institute of Information Technology, Design and Manufacturing Jabalpur
+XX-XXXXX-XXXXX
jagrati@iiitdmj.ac.in


November 23 2015
This is My First Article
Bacon ipsum dolor amet leberkas landjaeger pork chop, sirloin capicola kielbasa short loin cupim prosciutto pork swine meatloaf jowl picanha rump. Chuck beef ribs spare ribs prosciutto pork loin, short ribs sirloin frankfurter fatback kielbasa shankle. Biltong meatloaf kielbasa prosciutto alcatra.  Chicken hamburger pancetta kielbasa, brisket meatloaf cupim andouille beef ribs.
Landjaeger bresaola meatloaf, capicola cow jerky flank pork belly kielbasa biltong jowl short ribs sausage corned beef. Turducken ball tip chicken beef. Corned beef pig short loin t-bone ball tip meatloaf. Bresaola spare ribs tenderloin bacon pastrami tri-tip short loin, alcatra landjaeger capicola leberkas. Doner prosciutto brisket buffalo short ribs pastrami alcatra frankfurter turkey.
Pork loin swine jowl cupim capicola ham hock.  Fatback short loin meatball bresaola, buffalo filet mignon turducken pancetta landjaeger tongue.  Drumstick beef ribs pancetta ham picanha short ribs doner filet mignon cupim jowl boudin shank. Chicken strip steak porchetta spare ribs kielbasa.
December 11 2015
This is Another Article
Hamburger jowl burgdoggen doner pancetta ground round tail biltong turducken filet mignon. Andouille corned beef sausage brisket pancetta pork tri-tip leberkas shankle. Biltong picanha alcatra tri-tip chuck venison jerky, doner frankfurter filet mignon turducken sausage bacon pastrami kevin. Alcatra cow venison burgdoggen, ribeye porchetta filet mignon chicken spare ribs. Cow landjaeger alcatra, beef kevin chicken capicola short loin frankfurter pastrami tri-tip tenderloin t-bone prosciutto. Turkey swine buffalo, brisket frankfurter flank strip steak pork kevin. Corned beef tenderloin meatloaf flank shank pork porchetta leberkas.
Spare ribs meatball rump ground round swine meatloaf, biltong pork chop. Turducken burgdoggen jerky, rump chuck ball tip bacon kevin kielbasa biltong strip steak tenderloin hamburger ribeye prosciutto. Boudin jowl pancetta sausage short ribs fatback filet mignon andouille alcatra. Kielbasa t-bone beef ribs ground round andouille ham hock salami capicola chicken frankfurter jowl brisket. Burgdoggen boudin fatback meatball. Chicken shankle spare ribs burgdoggen ball tip. Venison burgdoggen cow capicola, boudin jerky ball tip ham flank.
Corned beef fatback swine ground round shank cupim turkey. Doner corned beef sausage, buffalo picanha meatball prosciutto ham hock rump tenderloin.  Landjaeger short loin alcatra beef ribs drumstick short ribs ground round t-bone boudin tail strip steak picanha cupim.


SAFE PASSAGE A film review by Ben Hoffman Copyright 1994 Ben Hoffman
Susan Sarandon, as Mag, turns in another of her many wonderful screen portrayals. Directors and producers cannot go wrong when they choose Sarandon. Here, in SAFE PASSAGE, she is the mother of seven grown sons. Her husband, Patrick (Sam Shepard) chooses to live at the office but that is okay; they are still very much in love. With all the sons now out of the house, except for fourteen-year-old Simon (Nick Stahl), Mag is thinking of being free at last of household duties.
Just as Mag wants to pursue her dreams of mingling in the working world outside of home, word comes that Percival (Matt Keeslar), who had joined the Marines to get away from family pressures, may have been among those blown up in a surprise attack of a barracks in the Middle East.
Now the family begins to come together to sweat out the vigil. There is the scientist, Izzy (Sean Astin), Alfred and his girlfriend Cynthia (Robert Sean Leonard and Marcia Gay Harden), athlete Gideon, (Jason London), twins Merle and Darren (Philip and Steve Ross) ... and, of course, the dad, Patrick. Although each has his own life, this is a time when they have to get together and listen to skimpy news. >From official reports they get nothing concrete.
News reports could mean Percival was among the dead or missing. And they talk. They talk about old times and about things they never before had revealed to each other and they talk about how their parents raised them and how the sons affected the parents as well. And all the time the tension escalates.
The acting by all the sons is faultless. The plight of the family gets you in its grip.  A great performance. Let us not overlook Sam Shepard's role as the father. Fine acting all around.
Directed by Robert Allan Ackerman.
4 Bytes 4 Bytes = Absolutely must see. 3 Bytes = Too good to be missed. 2 Bytes = So so. 1 Byte = Save your money.
Ben Hoffman
.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


What is your name?
What is your technical experience?
What kind of projects would you like to build?
What kind of technical teams you would like to work with?
What size of company you would like to work for?
What is your top reason to learn programming?
you should learn


Use the CSS width property to determine a specific width of the columns.
20%
60%
45%
55%
15%
35%
10%
30%


Compare the two canvases.
Your browser does not seem to support HTML5 canvas.
Your browser does not seem to support HTML5 canvas.


Users name: {{formSubmit.user.data.displayName}}
Note. Only a recruiter is authorised to submit this form.


Associate Professor
Electrical Engineering
IIT Kharagpur
Scientist
Indian Institute of Tropical Meteorology
Research Group Leader
Division of Immunology
University of Cambridge
Head of Imaging Development Unit
Institute FIRC of Molecular Oncology
Milan, Italy.
Scientist
Technical University of Dresden
Germany
Associate Professor
Department of Electrical Engineering
IIT Patna
Physics Teacher and
Science Activist
Falta Vivekananda Adarsha Vidyalaya
Doctoral Research Scholar at ATDC, IIT KHARAGPUR
Studies PhD in Computer Science at McGill University
Studies B.Tech in Mechanical Engineering Academy of Technology
Studies B.Tech in Information Technology at RCC Institute of Information Technology
Studies Integrated M.Tech in Aeronautics Engineering at Indian Institute of Technology Kharagpur
Studies B.Tech in Computer Science at Kalinga Institute of Industrial Technology


--- layout: post title: "REST lesson learned: Consider a self link on all resources" description: "Add a self-link on RESTful resource." date: 2013-05-03 10:32 UTC tags: [Software Design, Services, REST] --- {% include JB/setup %}
{{ page.description }}
This suggestion is part of my REST lessons learned series of blog posts. Contrary to previous posts, this advice doesn't originate from a lesson learned the hard way, but is more of a gentle suggestion.
One of the many advantages of a well-designed REST API is that it's 'web-scale'. The reason it's 'web-scale' is because it can leverage HTTP caching.
HTTP caching is based on URLs. If two URLs are different, they represent different resources, and can't be cached as one. However, conceivably, a client could arrive at the same resource via a number of different URLs:
Consider, as courtesy, adding a self-link to all resources. Adding a self link is as easy as this:
<product xmlns="http://fnaah.ploeh.dk/productcatalog/2013/05" xmlns:atom="http://www.w3.org/2005/Atom"> <atom:link href="http://catalog.api.ploeh.dk/products/1337" rel="self" /> <atom:link href="http://catalog.api.ploeh.dk" rel="http://catalog.api.ploeh.dk/docs/rels/home" /> <atom:link href="http://catalog.api.ploeh.dk/categories/chocolate" rel="http://catalog.api.ploeh.dk/docs/rels/category" /> <atom:link href="http://catalog.api.ploeh.dk/categories/gourmet" rel="http://catalog.api.ploeh.dk/docs/rels/category" /> <name>Fine Criollo dark chocolate</name> <price>50 DKK</price> <weight>100 g</weight> </product>
Notice the link with the rel value of "self"; from its href value you now know that the canonical URL of that product resource is http://catalog.api.ploeh.dk/products/1337
.
Particularly when there are (technically) more than one URL that will serve the same content, do inform the client about the canonical URL. There's no way a client can tell which URL variation is the canonical URL. Only the API knows that.
A level 3 RESTful API can evolve over time. As I previously described, you may start with URLs like http://foo.ploeh.dk/orders/1234
only to realize that in a later version of the API, you'd rather want it to be http://foo.ploeh.dk/customers/1234/orders
.
As the RESTful Web Services Cookbook explains, you should keep URLs cool. In practice, that means that if you change the URLs of your API, you should at least leave a 301 (Moved Permanently) at the old URL.
If you imagine a mature API, this may have happened more than once, which means that a client arriving at one of the original URLs may be redirected several times.
In your browser, you know that if redirects happen, the address bar will (normally) display the final URL at which you arrived. However, consider that REST clients are applications. It will be implementation-specific whether or not the client realizes that the value of the final address isn't the URL originally requested.
As a courtesy to clients, do consider informing them of the final address at which they arrived.
While the following scenario isn't applicable for level 3 RESTful APIs, level 1 and 2 services require clients to construct URLs from templates. As an example, such services may define a product search resource as /products/search?q={query}&p={page}
. To search for chocolate (and see the third (zero-indexed) page) you could construct the URL as /products/search?q=chocolate&p=2
. However, most platforms (e.g. the ASP.NET Web API) would handle /products/search?p=2&q=chocolate
in exactly the same way. The more query parameters you allow, the more permutations are possible.
This is a well-known problem in search (and computer science); it's called Canonicalization. Only the API knows the canonical value of a given URL: do consider informing the client about this value.
Adding a self-link to each resource isn't much of a burden for the service, but could provide advantages for both the service and its clients. In most cases I'd expect the ROI to be high, simply because the investment is low.
Comments
The primary reason I didn't mention the Content-Location header here was that, frankly, I wasn't aware of it. Now that I've read the specification, I'll have to take your word for it :) You may be right, in which case there's no particular reason to prefer a self-link over a Content-Location header.
When it comes following links, it's true that a protocol-near client would know the location after each redirect. The question is, if you're using an HTTP library, do you ever become aware of this?
Consider a client, using a hypothetical HTTP client library:
The response may actually be the result of various redirects, so that the final response is from "/bar", but unless the client is very careful, it may never notice this.


Did anyone else see this coming?
This is very transparent.
A lot of noise in that cabinet!
Word.
I saw it coming.


FLIPPER A film review by Steve Rhodes Copyright 1996 Steve Rhodes
RATING (0 TO ****): *
Having recently seen and survived, but just barely, the new movie FLIPPER with Paul Hogan (CROCODILE DUNDEE) and Elijah Wood (THE ADVENTURES OF HUCK FINN), we decided to rent the 1963 original movie which inspirited two TV series in addition to the remake.
 The original is a somnolent little treatise on the minutia of living near the ocean. Careful never to offend anyone and taking absolutely no risks, the show meanders until is finally put to sleep by a benevolent editor (Warren Adams).
Director James B. Clark's specialty is children's B movies, having directed such unmemorable films as A DOG OF FLANDERS, ISLAND OF THE BLUE DOLPHINS, MY SIDE OF THE MOUNTAIN, and THE LITTLE ARK. Here he makes his only well known film, and why it was so successful is beyond this critic. Yes, the dolphin star is photogenic, but he gets much less screen time the actors.
Since there really is no plot, a summary seems superfluous, but let me tell you all you need to know. Around 10 year old Sandy Ricks (Luke Halpin) lives with his fisherman father Porter (Chuck Connors from the "Rifleman" TV show) and his mother Martha (Kathleen Maquire) near the ocean.
As the show starts, Kim Parker (Connie Scott) has just come to visit. Sandy tells her sincerely, "Your lucky, a hurricane on your first visit." Needless to say, the big storm sounds ferocious but its effects are fairly tame.
To the extent that anything occurs in the show, it has to do with Flipper's being speared by a bad kid, rescued by Sandy, and then later saving Sandy from sharks in return. Most scenes are of little consequence. Typical is the one where Sandy is working in the yard and tossing balls to Flipper.
The music (Henry Vars) sounds straight out of one of those Disney Living Desert TV documentaries. Most of the show is dominated by the loud violins whose sole purpose seems to be to anesthetize the audience. The song during the show proclaims loudly that, "Flipper lives in a world full of wonder." Perhaps he does, but not in this show.
Other than Flipper, who is cute, the only other aspect of the film with any merit is the cinematography by Lamar Boren and Joseph Brun.
FLIPPER runs 1:27. It is not rated, but would get a G today. There is no sex, nudity, or even mildly offensive language. The violence is confined to the hurricane hitting, a spear into Flipper and Flipper's shark fight. Jeffrey (age seven) says he recommends it to kids four and up, but feels that the shark and hurricane scenes may be too intense for younger kids. He actually likes the original better than the remake, which he also likes. I hate them both, but if forced at gunpoint to watch one of them again, I'd go for the remake. At least it takes some risks and has a few imaginative scenes. I give the original just barely one *.
**** = One of the top few films of this or any year. A must see film. *** = Excellent show. Look for it. ** = Average movie. Kind of enjoyable. * = Poor show.  Totally unbearable.
REVIEW WRITTEN ON: August 17, 1996
Opinions expressed are mine and not meant to reflect my employer's.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Enter the email address you used when signing up for your profile here on Pulsar, then select the Request Password Reset button below.
An email has been sent to {{request.email}} with the details needed to reset your login password here on Pulsar. Please check your email and follow the included instructions to reset your password.


These classes maintain the information accumulated
during a racing season and are written out to file when the user saves.
No (or at least very little) calculation goes on within these classes.
Changing these classes may result in incompabilities when loading files saved
with different versions of the application.
All of these model classes are immutable which I believe makes using them
safer and easier.


A UNIX crontab-like pattern is a string split in five space separated parts. Each part is intended as:
This pattern causes a task to be launched once every hour, at the begin of the fifth minute (00:05, 01:05, 02:05 etc.).
* * * * *This pattern causes a task to be launched every minute.
* 12 * * MonThis pattern causes a task to be launched every minute during the 12th hour of Monday.
* 12 16 * MonThis pattern causes a task to be launched every minute during the 12th hour of Monday, 16th, but only if the day is the 16th of the month.
Every sub-pattern can contain two or more comma separated values.
59 11 * * 1,2,3,4,5This pattern causes a task to be launched at 11:59AM on Monday, Tuesday, Wednesday, Thursday and Friday.
Values intervals are admitted and defined using the minus character.
59 11 * * 1-5This pattern is equivalent to the previous one.
The slash character can be used to identify step values within a range. It can be used both in the form */c and a-b/c. The subpattern is matched every c values of the range 0,maxvalue or a-b.
*/5 * * * *This pattern causes a task to be launched every 5 minutes (0:00, 0:05, 0:10, 0:15 and so on).
3-18/5 * * * *This pattern causes a task to be launched every 5 minutes starting from the third minute of the hour, up to the 18th (0:03, 0:08, 0:13, 0:18, 1:03, 1:08 and so on).
*/15 9-17 * * *This pattern causes a task to be launched every 15 minutes between the 9th and 17th hour of the day (9:00, 9:15, 9:30, 9:45 and so on... note that the last execution will be at 17:45).
All the fresh described syntax rules can be used together.
* 12 10-16/2 * *This pattern causes a task to be launched every minute during the 12th hour of the day, but only if the day is the 10th, the 12th, the 14th or the 16th of the month.
* 12 1-15,17,20-25 * *This pattern causes a task to be launched every minute during the 12th hour of the day, but the day of the month must be between the 1st and the 15th, the 20th and the 25, or at least it must be the 17th.
Finally cron4j lets you combine more scheduling patterns into one, with the pipe character:
0 5 * * *|8 10 * * *|22 17 * * *This pattern causes a task to be launched every day at 05:00, 10:08 and 17:22.
Reproduced from Cron4j documentation


Discover like-minded pals nearby! Join together to do exciting activities together!
Search for exciting activities that you are planning to do, see who else is looking to do similar things nearby.
Like the ones who you find interesting. If they like you back, you will get matched and can message and plan to get together in real life. Easy as pie!


You type up a brilliant Executive Director-ie spiel on the importance of canning and send it off. You wonder what will come of that email, if anything, as you log of and walk away.


Toggle navigation
Realestate
company
Home
Our Service
Customer service
Buying service
Selling service
Corporate service
Export
Import
Selling
Project
Contact Us
Profile
Logout
Registration
Login
×
This is company form
Login here
Username
*
Password
*
Not yet registered! Then register first.
First name
Last name
Email
Password
Contact number
Address
Realestate company
Realestate company is Best Solution to Sell and Buy House Online
CONTACT INFO
500 Terry Francois Street San Francisco, CA 94158
Phone :<PHONE_NUMBER>
Fax :<PHONE_NUMBER>
Email<EMAIL_ADDRESS>Web :
www.realestatecompany.com/
OUR LOCATION


The core Dune function and associated functions
Dune()
Dune
ARIs()
ARI Matrix
Functions to track how objects evolve as merging occurs
ARIImp()
ARI improvement
clusterConversion()
clusterConversion
functionTracking()
Track the evolution of a function along merging
intermediateMat()
Find the clustering matrix that we would get if we stopped the ARI merging early
Functions to plot the results and many other tools to compare clusterings.
ARItrend()
ARI improvement plot
ConfusionPlot()
Plot confusion matrix
plotARIs()
Plot an heatmap of the ARI matrix
plotPrePost()
Plot the reduction in cluster size for an ARI merging with Dune
Functions to plot the results and many other tools to compare clusterings in a dynamic format.
ARIEvolution()
Plot the evolution of the pairwise ARIs as merging happens
ConfusionEvolution()
Plot the evolution of the ConfusionPlot as merging happens
The datasets used in examples
clusMat
A clustering matrix used to demonstrate the ari-merging process.
nuclei
Cluster labels for a subset of the allen Smart-Seq nuclei dataset
Functions used internally for Dune
.adjustedRandIndex()
adjustedRandIndex
whenToStop()
When to Stop


QCameraImageCaptureControl Class
The QCameraImageCaptureControl class provides a control interface for image capture services. More...
| Header: | #include <QCameraImageCaptureControl> |
| qmake: | QT += multimedia |
| Inherits: | QMediaControl |
Public Functions
| ~QCameraImageCaptureControl() | |
| virtual void | cancelCapture() = 0 |
| virtual int | capture(const QString &fileName) = 0 |
| virtual QCameraImageCapture::DriveMode | driveMode() const = 0 |
| virtual bool | isReadyForCapture() const = 0 |
| virtual void | setDriveMode(QCameraImageCapture::DriveMode mode) = 0 |
- 32 public functions inherited from QObject
Signals
| void | error(int id, int error, const QString &errorString) |
| void | imageAvailable(int requestId, const QVideoFrame &buffer) |
| void | imageCaptured(int requestId, const QImage &preview) |
| void | imageExposed(int requestId) |
| void | imageMetadataAvailable(int id, const QString &key, const QVariant &value) |
| void | imageSaved(int requestId, const QString &fileName) |
| void | readyForCaptureChanged(bool ready) |
- 2 signals inherited from QObject
Protected Functions
| QCameraImageCaptureControl(QObject *parent = Q_NULLPTR) |
- 9 protected functions inherited from QObject
Macros
Additional Inherited Members
- 1 property inherited from QObject
- 1 public slot inherited from QObject
- 1 public variable inherited from QObject
- 10 static public members inherited from QObject
- 2 protected variables inherited from QObject
Detailed Description
The QCameraImageCaptureControl class provides a control interface for image capture services.
The interface name of QCameraImageCaptureControl is org.qt-project.qt.cameraimagecapturecontrol/5.0
as defined in QCameraImageCaptureControl_iid.
See also QMediaService::requestControl().
Member Function Documentation
[protected]
QCameraImageCaptureControl::QCameraImageCaptureControl(QObject *parent = Q_NULLPTR)
Constructs a new image capture control object with the given parent
QCameraImageCaptureControl::~QCameraImageCaptureControl()
Destroys an image capture control.
[pure virtual]
void QCameraImageCaptureControl::cancelCapture()
Cancel pending capture requests.
[pure virtual]
int QCameraImageCaptureControl::capture(const QString &fileName)
Initiates the capture of an image to fileName. The fileName can be relative or empty, in this case the service should use the system specific place and file naming scheme.
The Camera service should save all the capture parameters like exposure settings or image processing parameters, so changes to camera parameters after capture() is called do not affect previous capture requests.
Returns the capture request id number, which is used later with imageExposed(), imageCaptured() and imageSaved() signals.
[pure virtual]
QCameraImageCapture::DriveMode QCameraImageCaptureControl::driveMode() const
Returns the current camera drive mode.
See also setDriveMode().
[signal]
void QCameraImageCaptureControl::error(int id, int error, const QString &errorString)
Signals the capture request id failed with error code and message errorString.
See also QCameraImageCapture::Error.
[signal]
void QCameraImageCaptureControl::imageAvailable(int requestId, const QVideoFrame &buffer)
Signals that a captured buffer with a requestId is available.
[signal]
void QCameraImageCaptureControl::imageCaptured(int requestId, const QImage &preview)
Signals that an image with it requestId has been captured and a preview is available.
[signal]
void QCameraImageCaptureControl::imageExposed(int requestId)
Signals that an image with it requestId has just been exposed. This signal can be used for the shutter sound or other indicaton.
[signal]
void QCameraImageCaptureControl::imageMetadataAvailable(int id, const QString &key, const QVariant &value)
Signals that a metadata for an image with request id is available. Signal also contains the key and value of the metadata.
This signal should be emitted between imageExposed and imageSaved signals.
[signal]
void QCameraImageCaptureControl::imageSaved(int requestId, const QString &fileName)
Signals that a captured image with a requestId has been saved to fileName.
[pure virtual]
bool QCameraImageCaptureControl::isReadyForCapture() const
Identifies if a capture control is ready to perform a capture immediately (all the resources necessary for image capture are allocated, hardware initialized, flash is charged, etc).
Returns true if the camera is ready for capture; and false if it is not.
It's permissible to call capture() while the camera status is QCamera::ActiveStatus regardless of isReadyForCapture property value. If camera is not ready to capture image immediately, the capture request is queued with all the related camera settings to be executed as soon as possible.
[signal]
void QCameraImageCaptureControl::readyForCaptureChanged(bool ready)
Signals that a capture control's ready state has changed.
[pure virtual]
void QCameraImageCaptureControl::setDriveMode(QCameraImageCapture::DriveMode mode)
Sets the current camera drive mode.
See also driveMode().
Macro Documentation
QCameraImageCaptureControl_iid
org.qt-project.qt.cameraimagecapturecontrol/5.0
Defines the interface name of the QCameraImageCaptureControl class.


 Source
The giraffe (Giraffa) is a genus of African even-toed ungulate mammals, the tallest living terrestrial animals and the largest ruminants.
A giraffe's feet are the size of a dinner plate—12 inches across (30.5 centimeters).
The recorded running speed of a giraffe is 34.7 miles per hour (56 kilometers per hour).


Falling Ice
问题描述 :
Imagine disks of ice falling, one at a time, into a box, each ending up at the lowest point it can reach without overlapping or moving previous disks. Each disk then freezes into place, so it cannot be moved by later disks. Your job is to find the overall height of the final combination of disks.
So that the answer is unique, assume that any disk reaching the bottom of the box rolls as far to the left as possible. Also the data is chosen so there will be a unique lowest position for any disk that does not reach the bottom. The data is also such that there are no "perfect fits": each disk that lands will be in contact with only two other points, on previous circles or the sides of the box. The illustrations above show white filled disks labeled with the order in which they fall into their boxes. The gray circle in the fourth illustration is not intended to be a disk that fell in. The gray disk is included to demonstrate a point: the gray disk is the same size as disk 2, so there is space for disk 2 on the very bottom of its box, but disk 2 cannot reach that position by falling from the top. It gets caught on disk 1 and the side of the box.
One way to find the top intersection point of two intersecting circles is as follows. Suppose circle 1 has center (x1, y1) and radius r1, and suppose circle 2 has center (x2, y2), and radius r2. Also assume that circle 1 is to the left of circle 2, i.e., x1 < x2. Let
dx = x2 – x1,
dy = y2 – y1,
D = sqrt(dx*dx + dy*dy),
E = (r1*r1 – r2*r2 + D*D)/(2*D),
F = sqrt(r1*r1 – E*E);
then the upper intersection point is (x1 + (E*dx – F*dy)/D, y1 + (F*dx + E*dy)/D).
输入:
输出:
样例输入:
10 3 5 2 3 8 2 5 5 11 3 10 2 4 9 3 4 4 6 10 6 5 4 6 3 5 2 0
样例输出:
5.00 9.00 12.99 9.58 14.19
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
又不是全地球只有一个人类适合你
第二个方法很不错啊
为什么for循环找到的i一定是素数叻，而且约数定理说的是n=p1^a1*p2^a2*p3^a3*…*pk^ak，而你每次取余都用的是原来的m，也就是n
还是有些难度的！
不错，感谢分享。
,,,,,,,,,,,,,,,
学习了
大哥，你复制也看看是不是这题的答案才复制吧。
有点意思
这种二分还是比较经典！mark
第一题是不是可以这样想，生了n孩子的家庭等价于n个家庭各生了一个1个孩子，这样最后男女的比例还是1:1
“再把所有不和该节点相邻的节点着相同的颜色”，程序中没有进行不和该节点相邻的其他节点是否相邻进行判断。再说求出来的也不一样是颜色数最少的
能不能说一下tmp数组和solve都是干嘛的？
很好！！
已更正。